Constructivism in mathematics. An introduction. Volume I
From MaRDI portal
Publication:1188500
zbMath0653.03040MaRDI QIDQ1188500
A. S. Troelstra, Dirk van Dalen
Publication date: 17 September 1992
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Bishop's constructive mathematicsBrouwer's intuitionismMarkov's constructive recursive mathematicsmetamathematics of constructivism
Constructive and recursive analysis (03F60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other constructive mathematics (03F65) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)
Related Items (only showing first 100 items - show all)
On V.A. Yankov’s Contribution to the History of Foundations of Mathematics ⋮ A Generalized Realizability and Intuitionistic Logic ⋮ On the Cauchy completeness of the constructive Cauchy reals ⋮ Direct spectra of Bishop spaces and their limits ⋮ RELATIVIZING OPERATIONAL SET THEORY ⋮ Unnamed Item ⋮ Hardwiring truth in functional interpretations ⋮ Negative predication and distinctness ⋮ Decidable fan theorem and uniform continuity theorem with continuous moduli ⋮ König's lemma, weak König's lemma, and the decidable fan theorem ⋮ Finitely axiomatized theories lack self‐comprehension ⋮ Intrinsic theories and computational complexity ⋮ EXTENDED FRAMES AND SEPARATIONS OF LOGICAL PRINCIPLES ⋮ Sheaves of structures, Heyting‐valued structures, and a generalization of Łoś's theorem ⋮ Intuitionistic propositional probability logic ⋮ Coding of real‐valued continuous functions under WKL$\mathsf {WKL}$ ⋮ Wansing's bi-intuitionistic logic: semantics, extension and unilateralisation ⋮ Formally continuous functions on Baire space ⋮ Intuitionistic logic is a connexive logic ⋮ Cardinality reduction theorem for logics QHC and QH4 ⋮ The Gödel-McKinsey-Tarski embedding for infinitary intuitionistic logic and its extensions ⋮ Linear depth deduction with subformula property for intuitionistic epistemic logic ⋮ Intuitionistic mereology. II: Overlap and disjointness ⋮ THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC ⋮ Unnamed Item ⋮ Assertive graphs ⋮ Some elementary results in intuitionistic model theory ⋮ Some theories with positive induction of ordinal strength φω0 ⋮ The Borel Hierarchy Theorem from Brouwer's intuitionistic perspective ⋮ Semigroups with apartness ⋮ A SOLUTION TO THE SURPRISE EXAM PARADOX IN CONSTRUCTIVE MATHEMATICS ⋮ BROUWER’S WEAK COUNTEREXAMPLES AND TESTABILITY: FURTHER REMARKS ⋮ Completeness of intermediate logics with doubly negated axioms ⋮ Temporal Gödel‐Gentzen and Girard translations ⋮ On the failure of BD-ℕ and BD, and an application to the anti-specker property ⋮ ANTIREALISM AND CONSTRUCTIVISM: BROUWER’S WEAK COUNTEREXAMPLES ⋮ On the Cauchy Completeness of the Constructive Cauchy Reals ⋮ REALIZABILITY SEMANTICS FOR QUANTIFIED MODAL LOGIC: GENERALIZING FLAGG’S 1985 CONSTRUCTION ⋮ Interactive Realizability for second-order Heyting arithmetic with EM1 and SK1 ⋮ A generalization of the Takeuti–Gandy interpretation ⋮ Generalized geometric theories and set-generated classes ⋮ A MODAL TRANSLATION FOR DUAL-INTUITIONISTIC LOGIC ⋮ INTUITIONISTIC EPISTEMIC LOGIC ⋮ A variant of Thomason's first-order logic CF based on situations ⋮ Intuitionistic open induction and least number principle and the Buss operator ⋮ Rules and arithmetics ⋮ Note on Conditional Constructivity ⋮ Universes in explicit mathematics ⋮ On Tao's “finitary” infinite pigeonhole principle ⋮ Unnamed Item ⋮ Extending the system T\(_0\) of explicit mathematics: The limit and Mahlo axioms ⋮ Type theories, toposes and constructive set theory: Predicative aspects of AST ⋮ Analyzing realizability by Troelstra's methods ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic ⋮ A(nother) characterization of intuitionistic propositional logic ⋮ Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models ⋮ Completeness of type assignment systems with intersection, union, and type quantifiers ⋮ Real numbers and other completions ⋮ The Herbrand topos ⋮ The Herbrand topos ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ Some preservation theorems in an intermediate logic ⋮ Normalization by Evaluation for Typed Weak lambda-Reduction ⋮ On the proof theory of type two functionals based on primitive recursive operations ⋮ A note on Bar Induction in Constructive Set Theory ⋮ The disjunction and related properties for constructive Zermelo-Fraenkel set theory ⋮ Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations ⋮ Completeness and incompleteness for intuitionistic logic ⋮ Free Definite Description Theory – Sequent Calculi and Cut Elimination ⋮ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC ⋮ Realizability interpretation of generalized inductive definitions ⋮ Category theory, logic and formal linguistics: some connections, old and new ⋮ A semantic approach to conservativity ⋮ Semantic completeness of first-order theories in constructive reverse mathematics ⋮ Subminimal logics in light of Vakarelov's logic ⋮ The information in intuitionistic logic ⋮ Insight in discrete geometry and computational content of a discrete model of the continuum ⋮ Basic notions of (constructive) semigroups with apartness ⋮ Formalizing non-termination of recursive programs ⋮ Algebraic proofs of cut elimination ⋮ Some obstacles facing a semantic foundation for constructive mathematics ⋮ Extensional realizability ⋮ Mathematical method and proof ⋮ Variable declarations in natural deduction ⋮ Ideals in constructive Banach algebra theory ⋮ Pre-apartness structures on spaces of functions ⋮ Propositional lax logic ⋮ A constructive formulation of Gleason's theorem ⋮ On unification and admissible rules in Gabbay-de Jongh logics ⋮ Specification of abstract dynamic-data types: A temporal logic approach ⋮ Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative ⋮ Constructive agents ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Constructive knowledge and the justified true belief paradigm ⋮ Arithmetical conservation results ⋮ Coherence for sharing proof-nets ⋮ A new framework for declarative programming ⋮ First-order logic in the Medvedev lattice ⋮ On the strong normalisation of intuitionistic natural deduction with permutation-conversions
This page was built for publication: Constructivism in mathematics. An introduction. Volume I
