Decidable Kripke models of intuitionistic theories (original) (raw)
Related papers
Decidability and Specker sequences in intuitionistic mathematics
2009
Intuitionistic computability logic
Cornell University - arXiv, 2004
Journal of Symbolic Computation, 1985
Axiomatic Approach to the Theory of Algorithms and Relativized Computability
THE POLYNOMIAL HIERARCHY AND INTUITIONISTIC BOUNDED ARITHMETIC
Turing-Church thesis, constructve mathematics and intuitionist logic
2021
Constructivity and Computability in Historical and Philosophical Perspective
Logic, Epistemology, and the Unity of Science, 2014
2007
Primitive Recursive Realizability and Basic Propositional Logic
2007
Computable Kripke Models and Intermediate Logics
Information and Computation, 1998
Directions for Computability Theory Beyond Pure Mathematical
Mathematical Problems from Applied Logic II
A model of intuitionism based on Turing degrees
2013
The completeness of intuitionistic propositional calculus for its intended interpretation
Notre Dame Journal of Formal Logic, 1981
Expressibility in the elementary theory of recursively enumerable sets with realizability logic
Algebra and Logic, 1981
The Foundations of Computability Theory
Springer eBooks, 2020
The Journal of Symbolic Logic, 1976
Intuitionistically provable recursive well-orderings
Annals of Pure and Applied Logic, 1986
An intuitionistic theory of types with assumptions of high-arity variables
Annals of Pure and Applied Logic, 1992
Journal of Functional Programming, 2001
Eective -models versus recursively enumerable -theories
2000
Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
Journal of Logic and Computation, 2003
Category Theory as a Framework for an in re Interpretation of Mathematical Structuralism
The Age of Alternative Logics, 2006
Classical and Intuitionistic Models of Arithmetic
Notre Dame Journal of Formal Logic 37, 1996, 452–461, 1996
On some first-order theories which can be represented by definitions. (Report at the conference)
Constructing Recursion Operators in Intuitionistic Type Theory
2000
1995: Most general first order theorems are not recursively enumerable
Theoretical Computer Science, 1995
Computability in higher types and the universal domain Pω
STACS 84, 1984
Decidable Formulas of Intuitionistic Primitive Recursive Arithmetic
Rml, 2002
Semantics for First and Higher Order Realizability
L.E.J. Brouwer's `Unreliability of the logical principles'. A new translation, with an introduction