scientific article; zbMATH DE number 3237808

Cited in

(36)

Inductive completeness of logics of programs
Transfinite expansions of arithmetic formulas
scientific article; zbMATH DE number 3313428 (Why is no real title available?)
Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis
scientific article; zbMATH DE number 3382322 (Why is no real title available?)
Principles of reflection and second-order logic
\(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps
The Operational Perspective: Three Routes
The creating subject, the Brouwer-Kripke schema, and infinite proofs
From constructivism to computer science
To be or not to be constructive, that is not the question
Physical computability theses
Extensions to a generalization critic for inductive proof
Gödel and intuitionism
On the Completeness of Dynamic Logic
Intrinsic reasoning about functional programs. I: First order theories
Montague's paradox, informal provability, and explicit modal logic
Justification logic and type theory as formalizations of intuitionistic propositional logic
Parametric Church's thesis: synthetic computability without choice
On theorems of Gödel and Kreisel: Completeness and Markov's principle
Algorithmic properties of structures
Knowledge-based proof planning
Constructive recursive functions, Church's thesis, and Brouwer's theory of the creating subject: afterthoughts on a Parisian joint session
Formal notes on the substitutional analysis of logical consequence
The significance of relativistic computation for the philosophy of mathematics
scientific article; zbMATH DE number 3253161 (Why is no real title available?)
Formal ontology and mathematics. A case study on the identity of proofs
The substitutional analysis of logical consequence
Verificationism and Classical Realizability
Some applications of Gentzens second consistency proof
Five observations concerning the intended meaning of the intuitionistic logical constants
Well-partial orderings and their maximal order types
The ontology of digital physics
Unfolding schematic systems
INCOMPLETENESS VIA PARADOX AND COMPLETENESS
Rosser provability and the second incompleteness theorem

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)