scientific article; zbMATH DE number 3557754
From MaRDI portal
Publication:4133603
Cited in
(only showing first 100 items - show all)- Are mathematical theorems analytic or synthetic?
- On some non-classical extensions of second-order intuitionistic propositional calculus
- Intuitionistic truth
- On powerdomains and modality
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
- Program-substitution and admissibility of rules in algorithmic logic
- An algebraic semantics approach to the effective resolution of type equations
- On the Brouwerian concept of negative continuity
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic
- A weak intuitionistic propositional logic with purely constructive implication
- Validity and quantification in intuitionism
- A propositional logic with explicit fixed points
- The World's simplest axiom of choice fails
- On the status of proofs by contradiction in the seventeenth century
- Dummett's intuitionism is not strict finitism
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Constructing type systems over an operational semantics
- Toward a modal-structural interpretation of set theory
- Hilbert's \(\varepsilon{}\)-operator and classical logic
- Intuitionist logic, a logic of justification
- Negationless intuitionism
- Definitional equivalence and algebraizability of generalized logical systems
- Formal systems for modal operators on locales
- On theorems of Gödel and Kreisel: Completeness and Markov's principle
- Classical harmony: Rules of inference and the meaning of the logical constants
- Computational adequacy of the FIX-logic
- Quantum mechanical unbounded operators and constructive mathematics -- a rejoinder to Bridges
- On the origins of Dénes König's infinity lemma
- Propositional lax logic
- A constructive approach to state description semantics
- Paraconsistency everywhere
- Proof-search in type-theoretic languages: An introduction
- Meaning explanations at higher dimension
- Free choice sequences: a temporal interpretation compatible with acceptance of classical mathematics
- Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem
- Can constructive mathematics be applied in physics?
- The foundation of a generic theorem prover
- Intuitionistic completeness and classical logic
- Constructive mathematics and unbounded operators -- a reply to Hellman
- Creative subject, Beth models and neighbourhood functions
- A constructive topological proof of van der Waerden's theorem
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels
- Paradox and potential infinity
- Basic intuitionistic conditional logic
- The paradox of phase transitions in the light of constructive mathematics
- An intuitionist reasoning upon formal intuitionist logic: logical analysis of Kolmogorov's 1932 paper
- Structural relativity and informal rigour
- Wave-particle duality and the objectiveness of ``true and ``false
- What is constructive mathematics?
- A logic of delegation
- Inference and epistemic transparency
- Book review of: E. Martino, Intuitionistic proof versus classical truth. The role of Brouwer's creative subject in intuitionistic mathematics
- Truth as an epistemic notion
- Manifestability and epistemic truth
- Anti-realist truth and truth-recognition
- Gleason's theorem is not constructively provable
- Parts, classes and parts of classes: an anti-realist reading of Lewisian mereology
- Algorithmic foundations of computable general equilibrium theory
- Metasequents and tetravaluations
- Intuitionism, Meaning Theory and Cognition
- Semantic completeness of first-order theories in constructive reverse mathematics
- Taming the incomputable, reconstructing the nonconstructive and deciding the undecidable in mathematical economics
- On the foundations of mathematical economics
- A minimalist foundation at work
- Arguments, proofs, and dialogues
- A proof-theoretic treatment of \(\lambda \)-reduction with cut-elimination: \(\lambda \)-calculus as a logic programming language
- On open-set lattices and some of their applications in semantics
- Intuitionism As Generalization
- Verificationism and the principle of non-contradiction
- Leibniz in Cantor’s Paradise: A Dialogue on the Actual Infinite
- Verificationism and Classical Realizability
- A Dialogical Account of the Intersubjectivity of Intuitionism
- Some Comments and Replies
- Dummett's case for intuitionism
- The realist theory of meaning
- Undecidability of First-Order Intuitionistic and Modal Logics with Two variables
- Intuitionistic epistemology and modal logics of verification
- Brouwer's incomplete objects
- Cohen and Set Theory
- TERMINATION OF ABSTRACT REDUCTION SYSTEMS
- A theory of local negation: The model and some applications
- Intuitionistic tense and modal logic
- scientific article; zbMATH DE number 4031682 (Why is no real title available?)
- Semantics and proof-theory of depth bounded Boolean logics
- Logic and time
- Intuitionistic completeness of first-order logic
- Intuitionistic mathematics and wittgenstein
- Contraction-free sequent calculi for intuitionistic logic
- Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative
- scientific article; zbMATH DE number 192927 (Why is no real title available?)
- Truth Definitions, Skolem Functions and Axiomatic Set Theory
- 1998 European Summer Meeting of the Association for Symbolic Logic
- Strict finitism and the happy sorites
- A Finite Hilbert‐Style Axiomatization of the Implication‐Less Fragment of the Intuitionistic Propositional Calculus
- Direct deductive computation on discourse representation structures
- Decidability in the Constructive Theory of Reals as an Ordered ℚ‐vectorspace
- The truth and nothing but the truth, yet never the whole truth: Frege, Russell and the analysis of unities
- scientific article; zbMATH DE number 1478228 (Why is no real title available?)
- Basic logic: reflection, symmetry, visibility
- Validating Brouwer's continuity principle for numbers using named exceptions
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 Q4133603)
