The following pages link to (Q4133603):
Displayed 50 items.
- Another proof of the intuitionistic Ramsey theorem (Q685402) (← links)
- Reflections on Bishop's philosophy of mathematics (Q788709) (← links)
- Sheaf models and massless fields (Q791215) (← links)
- Realizability and intuitionistic logic (Q792319) (← links)
- Equilibrium logic (Q854969) (← links)
- Constructive characterizations of bar subsets (Q866574) (← links)
- Semantical analysis of specification logic (Q913527) (← links)
- Indicative conditionals: factual or epistemic? (Q934821) (← links)
- Are mathematical theorems analytic or synthetic? (Q1061110) (← links)
- On some non-classical extensions of second-order intuitionistic propositional calculus (Q1061123) (← links)
- Intuitionistic truth (Q1062982) (← links)
- On powerdomains and modality (Q1067409) (← links)
- A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction (Q1075050) (← links)
- Program-substitution and admissibility of rules in algorithmic logic (Q1092655) (← links)
- An algebraic semantics approach to the effective resolution of type equations (Q1093359) (← links)
- On the Brouwerian concept of negative continuity (Q1094422) (← links)
- On the programs-as-formulas interpretation of parallel programs in Peano arithmetic (Q1100878) (← links)
- A weak intuitionistic propositional logic with purely constructive implication (Q1102265) (← links)
- Validity and quantification in intuitionism (Q1153139) (← links)
- A propositional logic with explicit fixed points (Q1156789) (← links)
- The ''World's simplest axiom of choice'' fails (Q1171570) (← links)
- On the status of proofs by contradiction in the seventeenth century (Q1182171) (← links)
- Dummett's intuitionism is not strict finitism (Q1187232) (← links)
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic (Q1193588) (← links)
- Constructing type systems over an operational semantics (Q1199709) (← links)
- Toward a modal-structural interpretation of set theory (Q1202500) (← links)
- Hilbert's \(\varepsilon{}\)-operator and classical logic (Q1208146) (← links)
- Intuitionist logic, a logic of justification (Q1258305) (← links)
- Negationless intuitionism (Q1267080) (← links)
- Definitional equivalence and algebraizability of generalized logical systems (Q1302288) (← links)
- Formal systems for modal operators on locales (Q1319366) (← links)
- On theorems of Gödel and Kreisel: Completeness and Markov's principle (Q1333319) (← links)
- Classical harmony: Rules of inference and the meaning of the logical constants (Q1340989) (← links)
- Computational adequacy of the FIX-logic (Q1349677) (← links)
- Quantum mechanical unbounded operators and constructive mathematics -- a rejoinder to Bridges (Q1362591) (← links)
- On the origins of Dénes König's infinity lemma (Q1365469) (← links)
- Propositional lax logic (Q1368378) (← links)
- A constructive approach to state description semantics (Q1414570) (← links)
- Paraconsistency everywhere (Q1430900) (← links)
- Proof-search in type-theoretic languages: An introduction (Q1575935) (← links)
- Constructive mathematics and quantum mechanics: Unbounded operators and the spectral theorem (Q1802394) (← links)
- Can constructive mathematics be applied in physics? (Q1818378) (← links)
- The foundation of a generic theorem prover (Q1823013) (← links)
- Intuitionistic completeness and classical logic (Q1882403) (← links)
- Constructive mathematics and unbounded operators -- a reply to Hellman (Q1902560) (← links)
- Creative subject, Beth models and neighbourhood functions (Q1908820) (← links)
- A constructive topological proof of van der Waerden's theorem (Q1910731) (← links)
- Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels (Q1923579) (← links)
- What is constructive mathematics? (Q2266012) (← links)
- Gleason's theorem is not constructively provable (Q2366249) (← links)