Constructivism in mathematics. An introduction. Volume II

Publication date: 17 September 1992

Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)

zbMATH Keywords

higher-order logic algebra constructive set theory Bishop's constructive mathematics sites Brouwer's intuitionism lawless sequences Markov's constructive recursive mathematics metamathematics of constructivism Choice sequences Finite type arithmetic Martin-Löf systems Proof theory of intuitionistic logic Semantical completeness Sheaves theories of operators topology of metric spaces

Mathematics Subject Classification ID

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)

Constructive Ackermann's interpretation ⋮ Proofs, grounds and empty functions: epistemic compulsion in Prawitz's semantics ⋮ Relative constructivity ⋮ The fundamental problem of general proof theory ⋮ Connectification for $n$-contraction ⋮ A constructive approach to nonstandard analysis ⋮ Positive Formulas in Intuitionistic and Minimal Logic ⋮ The logic of first order intuitionistic type theory with weak sigma-elimination ⋮ Totality in applicative theories ⋮ A Minimalist Foundation at Work ⋮ Logic in Category Theory ⋮ CZF does not have the existence property ⋮ Parametric Church's thesis: synthetic computability without choice ⋮ Mechanizing common knowledge logic using COQ ⋮ Quotienting the delay monad by weak bisimilarity ⋮ Creative subject, Beth models and neighbourhood functions ⋮ Intuitionistic Provability versus Uniform Provability in $$\mathsf{RCA}$$ ⋮ Spectra of selfadjoint operators in constructive analysis ⋮ Equality and equivalence, intuitionistically ⋮ Binary modal companions for subintuitionistic logics ⋮ Hard provability logics ⋮ Systems of explicit mathematics with non-constructive $\mu$-operator. II ⋮ A classical view of the intuitionistic continuum ⋮ Realizing Brouwer's sequences ⋮ A universal algorithm for Krull's theorem ⋮ Lifting proofs from countable to uncountable mathematics ⋮ Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language ⋮ Hermann Weyl's Intuitionistic Mathematics ⋮ Inverse semigroups with apartness ⋮ Equivalence of bar induction and bar recursion for continuous functions with continuous moduli ⋮ Finiteness in a Minimalist Foundation ⋮ The continuum and first-order intuitionistic logic ⋮ A topological approach to full belief ⋮ A characterization of ML in many-sorted arithmetic with conditional application ⋮ Lifschitz realizability for intuitionistic Zermelo-Fraenkel set theory ⋮ Satisfiability is false intuitionistically: a question from Dana Scott ⋮ The FAN principle and weak König's lemma in Herbrandized second-order arithmetic ⋮ On the independence of premiss axiom and rule ⋮ The Logic of Justification ⋮ Three faces of natural deduction ⋮ Unnamed Item ⋮ Reasoning processes in propositional logic ⋮ Infinity and verifiability in Carnap's inductive logic ⋮ Characterising Brouwer's continuity by bar recursion on moduli of continuity ⋮ Constructive Sheaf Semantics ⋮ Intuitionistic fixed point logic ⋮ A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms ⋮ A Calculus of Realizers for EM 1 Arithmetic (Extended Abstract) ⋮ Mathematics in Philosophy, Philosophy in Mathematics: Three Case Studies ⋮ Weyl and Intuitionistic Infinitesimals ⋮ On the logical philosophy of assertive graphs ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ Unavoidable sequences in constructive analysis ⋮ Verificationism and Classical Realizability ⋮ The Monotone Completeness Theorem in Constructive Reverse Mathematics ⋮ From Mathesis Universalis to Provability, Computability, and Constructivity ⋮ Point-Free Spectra of Linear Spreads ⋮ A Dialogical Account of the Intersubjectivity of Intuitionism ⋮ Reverse mathematics of topology: dimension, paracompactness, and splittings ⋮ Brouwer's fixed-point theorem in real-cohesive homotopy type theory ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Extending constructive operational set theory by impredicative principles ⋮ Proof-theoretic semantics and inquisitive logic ⋮ Univalent polymorphism ⋮ Collapsing partial combinatory algebras ⋮ Free logics are cut-free ⋮ An application of constructive completeness ⋮ Classical and constructive hierarchies in extended intuitionistic analysis ⋮ Pluralism in Logic: The Square of Opposition, Leibniz’ Principle of Sufficient Reason and Markov’s Principle ⋮ Implicit and explicit stances in logic ⋮ Toward a clarity of the extreme value theorem ⋮ ON ADOPTING KRIPKE SEMANTICS IN SET THEORY ⋮ Tableaux for constructive concurrent dynamic logic ⋮ On the rules of intermediate logics ⋮ Markov's rule revisited ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES ⋮ INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES ⋮ The seeming interdependence between the concepts of valid inference and proof ⋮ Two questions from Dana Scott: Intuitionistic topologies and continuous functions ⋮ Announcement as effort on topological spaces ⋮ Reverse formalism 16 ⋮ Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus ⋮ Ordinal analyses for monotone and cofinal transfinite inductions ⋮ Curry-Howard-Lambek correspondence for intuitionistic belief ⋮ An intuitionist reasoning upon formal intuitionist logic: logical analysis of Kolmogorov's 1932 paper ⋮ A game-semantic model of computation ⋮ Game of grounds ⋮ A categorical reading of the numerical existence property in constructive foundations ⋮ Reflections on reflections in explicit mathematics ⋮ First-order logics of evidence and truth with constant and variable domains ⋮ A theory of computation based on quantum logic. I ⋮ Une Preuve Formelle et Intuitionniste du Théorème de Complétude de la Logique Classique ⋮ Truth as an epistemic notion ⋮ Constructive algebraic integration theory ⋮ An extension of the equivalence between Brouwer's fan theorem and weak König's lemma with a uniqueness hypothesis ⋮ Parallelizations in Weihrauch reducibility and constructive reverse mathematics ⋮ Idempotent variations on the theme of exclusive disjunction ⋮ Formally computing with the non-computable ⋮ Constructive mathematics, Church's thesis, and free choice sequences ⋮ Denotational semantics for languages of epistemic grounding based on Prawitz's theory of grounds

This page was built for publication: Constructivism in mathematics. An introduction. Volume II