scientific article; zbMATH DE number 3237808
From MaRDI portal
Publication:5525322
Cited in
(44)- Principles of reflection and second-order logic
- Transfinite expansions of arithmetic formulas
- From constructivism to computer science
- On theorems of Gödel and Kreisel: Completeness and Markov's principle
- Five observations concerning the intended meaning of the intuitionistic logical constants
- To be or not to be constructive, that is not the question
- The ontology of digital physics
- The creating subject, the Brouwer-Kripke schema, and infinite proofs
- Knowledge-based proof planning
- Rosser provability and the second incompleteness theorem
- Justification logic and type theory as formalizations of intuitionistic propositional logic
- Parametric Church's thesis: synthetic computability without choice
- Montague's paradox, informal provability, and explicit modal logic
- Some applications of Gentzens second consistency proof
- Inductive completeness of logics of programs
- Well-partial orderings and their maximal order types
- Verificationism and Classical Realizability
- The Operational Perspective: Three Routes
- On the Completeness of Dynamic Logic
- \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps
- Extensions to a generalization critic for inductive proof
- The significance of relativistic computation for the philosophy of mathematics
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Physical computability theses
- Unfolding schematic systems
- Constructive recursive functions, Church's thesis, and Brouwer's theory of the creating subject: afterthoughts on a Parisian joint session
- Gödel and intuitionism
- Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis
- scientific article; zbMATH DE number 3253161 (Why is no real title available?)
- scientific article; zbMATH DE number 3313428 (Why is no real title available?)
- Algorithmic properties of structures
- scientific article; zbMATH DE number 3382322 (Why is no real title available?)
- Intrinsic reasoning about functional programs. I: First order theories
- The substitutional analysis of logical consequence
- Formal ontology and mathematics. A case study on the identity of proofs
- The Kleene-Post and Post's theorem in the calculus of inductive constructions
- A constructive interpretation of the logical constants
- Truth, proofs and functions
- Reflection ranks via infinitary derivations
- The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
- Separating Markov's principles
- Natural constructive proofs of A via A B, proof paradoxes, and impredicativity
- Gentzen-Mints-Zucker duality
- Formal notes on the substitutional analysis of logical consequence
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5525322)