The following pages link to (Q5799431):
Displaying 23 items.
- Logic for physical space. From antiquity to present day (Q382998) (← links)
- Classical logic and quantum logic with multiple and common lattice models (Q504691) (← links)
- Discernibility by symmetries (Q603910) (← links)
- From Hilbert's program to a logic tool box (Q1028646) (← links)
- Proof by consistency (Q1094888) (← links)
- On distance preserving transformations of Euclidean-like planes over the rational field (Q1226755) (← links)
- Schrödinger logics (Q1338481) (← links)
- Tarski on logical consequences (Q1924334) (← links)
- Paraconsistent metatheory: new proofs with old tools (Q2155941) (← links)
- On Bourbaki's axiomatic system for set theory (Q2263057) (← links)
- A completeness theorem for ''theories of kind W'' (Q2556327) (← links)
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries (Q2631966) (← links)
- Establishing Valid Arguments by Computer and Storing their Meanings: a Premiss of form A of Aristotelian Logic (Q3048319) (← links)
- On the Substitutional Characterization of First-Order Logical Truth (Q3156301) (← links)
- Report: an examination of a decision procedure (Q3281061) (← links)
- GP’s LP (Q3305678) (← links)
- Henkin’s Theorem in Textbooks (Q3454810) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- Axiomatization of a functional logic language (Q5096190) (← links)
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS (Q5117593) (← links)
- Syntactical Transforms (Q5608743) (← links)
- WHAT IS A RULE OF INFERENCE? (Q6193397) (← links)
