scientific article; zbMATH DE number 3216177
From MaRDI portal
zbMath0133.24601MaRDI QIDQ5343325
Stephen C. Kleene, Richard E. Vesley
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Algorithmic properties of structures, Encoding true second‐order arithmetic in the real‐algebraic structure of models of intuitionistic elementary analysis, Embeddings between partial combinatory algebras, Projective sets, intuitionistically, Some elementary results in intuitionistic model theory, Unnamed Item, Unnamed Item, Unnamed Item, Analyzing realizability by Troelstra's methods, The effects of effects on constructivism, Gilt das Lemma von König „konstruktiv“?, Kodifikation und Aussagenlogik, Fuzzy constructive logic, Unnamed Item, PCF extended with real numbers, Partial combinatory algebra and generalized numberings, THE FINE STRUCTURE OF THE INTUITIONISTIC BOREL HIERARCHY, Realizability Models Separating Various Fan Theorems, Spreads or choice sequences?, A classical view of the intuitionistic continuum, Realizing Brouwer's sequences, Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels, Intuitionistic completeness of first-order logic, Intuitive counterexamples for constructive fallacies, More about relatively lawless sequences, Equivalence of bar induction and bar recursion for continuous functions with continuous moduli, Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative, Retracing Cantor's first steps in Brouwer's company, Intuitionism and effective descriptive set theory, Brouwer and Euclid, Effective bounds from ineffective proofs in analysis: An application of functional interpretation and majorization, Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory, Generalising the fan theorem, Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces, First-order logic in the Medvedev lattice, Relative lawlessness in intuitionistic analysis, INTUITIONISTIC ANALYSIS AT THE END OF TIME, The double negation of the intermediate value theorem, Hierarchies of Effective Descriptive Set Theory, On the independence of premiss axiom and rule, Unnamed Item, Locatedness and overt sublocales, Unnamed Item, Note on the fan theorem, Some axioms for constructive analysis, Struktursätze der Algebra und Kompliziertheit logischer Schemata. III Algebraische Theorien und Verallgemeinerungen, Classical consequences of continuous choice principles from intuitionistic analysis, Metric spaces in synthetic topology, The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective, The principle of pointfree continuity, Weyl and Intuitionistic Infinitesimals, Sheaf toposes for realizability, Unavoidable sequences in constructive analysis, Free choice sequences: a temporal interpretation compatible with acceptance of classical mathematics, Validating Brouwer's continuity principle for numbers using named exceptions, Regular functors and relative realisability categories, A transfer theorem in constructive \(p\)-adic algebra, On a weakening of Markov's Principle, Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games, Classical and constructive hierarchies in extended intuitionistic analysis, Another proof of the intuitionistic Ramsey theorem, A Relationship between Equilogical Spaces and Type Two Effectivity, Extended fuzzy constructive logic, Aspects of predicative algebraic set theory. II: Realizability, Two simple sets that are not positively Borel, Equivalents of the (weak) fan theorem, The decision problem for some finite extensions of the intuitionistic theory of abelian groups, Brouwer's constructivism, A very strong intuitionistic theory, Some observations on intuitionistically elementary properties of linear orderings, Certain partial conservativeness properties of intuitionistic set theory with the principle of double complement of sets, Every metric space is separable in function realizability, The creating subject, the Brouwer-Kripke schema, and infinite proofs, On certain theorems of analysis in the formal system Kleene-Vesley, PASCAL in LCF: Semantics and examples of proof, Inductive definability in formal language theory, Mathematical interpretation of the fan theorem, Unnamed Item, COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS, Unnamed Item, TERMINATION OF ABSTRACT REDUCTION SYSTEMS, From what does the law of the excluded middle follow?, The theory of empirical sequences, A Coalgebraic View of Bar Recursion and Bar Induction, A model of intuitionistic analysis in which ⌀-definable discrete sets are subcountable, A new model for intuitionistic analysis, Exercising Nuprl’s Open-Endedness, MARKOV’S PRINCIPLE AND SUBSYSTEMS OF INTUITIONISTIC ANALYSIS, Extended bar induction in applicative theories, Fixed point theorems for precomplete numberings, Intuitionism: an inspiration?, The continuum hypothesis in intuitionism, COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS, Decidability and Specker sequences in intuitionistic mathematics, Solovay's relative consistency proof for FIM and BI, Informal theory of choice sequences, Markov's constructive analysis; a participant's view, A common axiom set for classical and intuitionistic plane geometry, Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session, Realizability and intuitionistic logic, Some purely topological models for intuitionistic analysis, The sequentially realizable functionals, Relative and modified relative realizability, Sheaf models for choice sequences, On some non-classical extensions of second-order intuitionistic propositional calculus, ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS, Toward useful type-free theories. I, Formally computing with the non-computable, Minimum classical extensions of constructive theories
