Formal systems for some branches of intuitionistic analysis
From MaRDI portal
Publication:5611760
DOI10.1016/0003-4843(70)90001-XzbMath0211.01101MaRDI QIDQ5611760
A. S. Troelstra, Georg Kreisel
Publication date: 1970
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Related Items
THE AXIOM OF CHOICE IS FALSE INTUITIONISTICALLY (IN MOST CONTEXTS), On choice sequences determined by spreads, Unnamed Item, CZF does not have the existence property, Unnamed Item, Between Turing and Kleene, A classical view of the intuitionistic continuum, Realizing Brouwer's sequences, Lifting proofs from countable to uncountable mathematics, Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions, EXTENSIONAL REALIZABILITY AND CHOICE FOR DEPENDENT TYPES IN INTUITIONISTIC SET THEORY, Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory, Choice and independence of premise rules in intuitionistic set theory, Satisfiability is false intuitionistically: a question from Dana Scott, Formally continuous functions on Baire space, Can there be no nonrecursive functions?, Relative lawlessness in intuitionistic analysis, Unnamed Item, Locatedness and overt sublocales, On a second order propositional operator in intuitionistic logic, From the weak to the strong existence property, A system of abstract constructive ordinals, Characterising Brouwer's continuity by bar recursion on moduli of continuity, The principle of pointfree continuity, Free choice sequences: a temporal interpretation compatible with acceptance of classical mathematics, The intuitionistic alternative set theory, Brouwer's constructivism, Unnamed Item, Über das Markov-Prinzip II, Analyzing realizability by Troelstra's methods, The use of Kripke's schema as a reduction principle, The creating subject, the Brouwer-Kripke schema, and infinite proofs, On the derivability of instantiation properties, INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES, Continuous Functions on Final Coalgebras, A hierarchy of Brouwer constructive functionals, The theory of empirical sequences, Theory of proofs (arithmetic and analysis), Eine beweistheoretische Anwendung partieller stetiger Funktionale, Extended bar induction in applicative theories, From constructivism to computer science, The disjunction and related properties for constructive Zermelo-Fraenkel set theory, THE CHARACTERIZATION OF WEIHRAUCH REDUCIBILITY IN SYSTEMS CONTAINING, Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session, Sheaf models for choice sequences, Higher order functions and Brouwer’s thesis, Constructive formalization of the Tennenbaum theorem and its applications, Semantical completeness of first-order predicate logic and the weak fan theorem, Toward useful type-free theories. I, \(QPC_ 2\): A constructive calculus with parameterized specifications
