Modified realizability and predicate logic

DOI10.1007/BF02355731zbMath0912.03027OpenAlexW2092876471MaRDI QIDQ1274048

Valery Plisko

Publication date: 11 January 1999

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02355731

zbMATH Keywords

arithmetic in all finite typesconstructive logicmodified realizabilitysemantics of predicate formulas

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Metamathematics of constructive systems (03F50)

Related Items (3)

Rules and arithmetics ⋮ Arithmetic complexity of the predicate logics of certain complete arithmetic theories ⋮ A survey of predicate realizability logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constructive formalization of the Tennenbaum theorem and its applications
• Metamathematical investigation of intuitionistic arithmetic and analysis. With contributions by C. A. Smorynski, J. I. Zucker and W. A. Howard
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• On the interpretation of intuitionistic number theory

This page was built for publication: Modified realizability and predicate logic