The following pages link to (Q5812175):
Displaying 50 items.
- A meta-logic of inference rules: Syntax (Q2987742) (← links)
- Partial and paraconsistent three-valued logics (Q2987760) (← links)
- On the Semantics of Intensionality (Q2988392) (← links)
- The compactness of first-order logic:from gödel to lindström (Q3141183) (← links)
- HOMOLOGY OF GROUPS AND THIRD BUSY BEAVER FUNCTION (Q3162706) (← links)
- ARITHMETIC MEAN BASED COMPENSATORY FUZZY LOGIC (Q3173440) (← links)
- Verificationism and the principle of non-contradiction (Q3220549) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Degrees of Computability (Q3232282) (← links)
- On the cut operation in Gentzen calculi (Q3236672) (← links)
- Recursive and Recursively Enumerable Orders (Q3244106) (← links)
- Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül (Q3246321) (← links)
- Varianten von Turingmaschinen (Q3253795) (← links)
- Some Theorems on Classes of Recursively Enumerable Sets (Q3255349) (← links)
- (Q3256314) (← links)
- On a Subrecursive Hierarchy and Primitive Recursive Degrees (Q3257773) (← links)
- A Theorem on General Recursive Functions (Q3269134) (← links)
- Recursive Functions Over Well Ordered Partial Orderings (Q3272473) (← links)
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ (Q3276700) (← links)
- Constructive Versions of Ordinal Number Classes (Q3281066) (← links)
- Note on Degrees of Partial Functions (Q3282933) (← links)
- The theory of transfinite recursion (Q3287243) (← links)
- Constructive Analogues of the Group of Permutations of the Natural Numbers (Q3290720) (← links)
- The Ω-consistency of ramified analysis (Q3292576) (← links)
- Über die Verallgemeinerung der Theorie der Rekursiven Funktionen für Abstrakte Mengen Geeigneter Struktur als Definitionsbereiche (Q3293401) (← links)
- Classes of Predictably Computable Functions (Q3293402) (← links)
- Kripke semantics for the logic of problems and propositions (Q3304397) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- FDE as the One True Logic (Q3305611) (← links)
- K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You (Q3305614) (← links)
- GP’s LP (Q3305678) (← links)
- The PRIZ system and propositional calculus (Q3316619) (← links)
- (Q3384166) (← links)
- The logic of interactive turing reduction (Q3426573) (← links)
- Quantifier probability logic and the confirmation paradox (Q3429448) (← links)
- Schemata: The Concept of Schema in the History of Logic (Q3430938) (← links)
- UN-KLEENE BOOLEAN EQUATION SOLVING (Q3434274) (← links)
- INTUITIONISTIC ANALYSIS AT THE END OF TIME (Q4602433) (← links)
- Classical and constructive hierarchies in extended intuitionistic analysis (Q4650268) (← links)
- Modal Tree‐Sequents (Q4879198) (← links)
- Primitive Recursiveness of Real Numbers under Different Representations (Q4921448) (← links)
- THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH (Q5000260) (← links)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV (Q5009678) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- ACKERMANN’S FUNCTION IN ITERATIVE FORM: A PROOF ASSISTANT EXPERIMENT (Q5037519) (← links)
- (Q5077350) (← links)
- The Cantor–Bernstein theorem: how many proofs? (Q5204798) (← links)
