Pages that link to "Item:Q1565791"
From MaRDI portal
The following pages link to Zur Deutung der intuitionistischen Logik (Q1565791):
Displaying 50 items.
- Some obstacles facing a semantic foundation for constructive mathematics (Q320173) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Effectively closed mass problems and intuitionism (Q408163) (← links)
- Toggling operators in computability logic (Q631756) (← links)
- Automation methods for logical derivation and their application in the control of dynamic and intelligent systems (Q742012) (← links)
- Mass problems associated with effectively closed sets (Q765664) (← links)
- States on semi-divisible generalized residuated lattices reduce to states on MV-algebras (Q835280) (← links)
- First-order logic in the Medvedev lattice (Q897478) (← links)
- Constructive system for automatic program synthesis (Q912589) (← links)
- Sequential operators in computability logic (Q999265) (← links)
- A foundation for support theory based on a non-Boolean event space (Q1044197) (← links)
- Non-classical propositional calculi in relation to methodological patterns of scientific investigation (Q1212922) (← links)
- From constructivism to computer science (Q1274450) (← links)
- A constructive valuation semantics for classical logic (Q1355127) (← links)
- An intuitionist reasoning upon formal intuitionist logic: logical analysis of Kolmogorov's 1932 paper (Q2070432) (← links)
- Proof-theoretic semantics and inquisitive logic (Q2240552) (← links)
- Book review of: E. Martino, Intuitionistic proof versus classical truth. The role of Brouwer's creative subject in intuitionistic mathematics (Q2323643) (← links)
- The intuitionistic fragment of computability logic at the propositional level (Q2373697) (← links)
- On the unity of duality (Q2482843) (← links)
- Notes on constructive negation (Q2500818) (← links)
- Constructive logic and the Medvedev lattice (Q2505132) (← links)
- Explicit provability and constructive semantics (Q2732527) (← links)
- Intuitionism, Meaning Theory and Cognition (Q2757999) (← links)
- Mass problems and intuitionistic higher-order logic (Q2799749) (← links)
- Strong and weak reducibility of algorithmic problems (Q2799750) (← links)
- Homotopy type theory and Voevodsky’s univalent foundations (Q2933829) (← links)
- Automath Type Inclusion in Barendregt’s Cube (Q3194722) (← links)
- Degrees of Unsolvability: A Tutorial (Q3195683) (← links)
- From Mathesis Universalis to Provability, Computability, and Constructivity (Q3305633) (← links)
- Positive Formulas in Intuitionistic and Minimal Logic (Q3455187) (← links)
- A Survey of Propositional Realizability Logic (Q3616428) (← links)
- Mass Problems and Measure-Theoretic Regularity (Q3655266) (← links)
- Die kontroverse um die intuitionistische logik vor ihrer axiomatisierung durch heyting im jahre 1930 (Q3787951) (← links)
- (Q3804645) (← links)
- (Q3981778) (← links)
- Proof theory in the USSR 1925–1969 (Q3984419) (← links)
- (Q3995126) (← links)
- Kolmogorov and mathematical logic (Q4032626) (← links)
- Heyting’s contribution to the change in research into the foundations of mathematics (Q4312340) (← links)
- Vasiliev's paraconsistent logic interpreted by means of the dual role played by the double negation law (Q4443009) (← links)
- (Q4693119) (← links)
- TYPED TIMED INPUT/OUTPUT AUTOMATA IN REAL-TIME, CYBERNETIC EXPLANATION (Q4693280) (← links)
- Hermann Weyl's Intuitionistic Mathematics (Q4847387) (← links)
- (Q4989402) (← links)
- Image of Soviet and Russian logic in the West. Latter Half of the XXth Century (Q5059702) (← links)
- Tiered Arithmetics (Q5214784) (← links)
- The basic intuitionistic logic of proofs (Q5294019) (← links)
- Realist Consequence, Epistemic Inference, Computational Correctness (Q5350353) (← links)
- BROUWER’S WEAK COUNTEREXAMPLES AND TESTABILITY: FURTHER REMARKS (Q5402237) (← links)
- Logical operations and Kolmogorov complexity (Q5958286) (← links)
