The following pages link to On notation for ordinal numbers (Q5772803):
Displayed 50 items.
- On the Semantics of Intensionality (Q2988392) (← links)
- Rice and Rice-Shapiro Theorems for transfinite correction grammars (Q3096086) (← links)
- Kleene's Amazing Second Recursion Theorem (Q3161629) (← links)
- Program Size Complexity of Correction Grammars in the Ershov Hierarchy (Q3188262) (← links)
- Arithmetical Predicates and Function Quantifiers (Q3226750) (← links)
- Hierarchies of number-theoretic predicates (Q3226751) (← links)
- Recursive Functions Over Well Ordered Partial Orderings (Q3272473) (← links)
- Constructive Versions of Ordinal Number Classes (Q3281066) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- Why Post Did [Not] Have Turing’s Thesis (Q3305321) (← links)
- K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You (Q3305614) (← links)
- Remarks on the development of computability (Q3310596) (← links)
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees (Q3370614) (← links)
- Effectivity Questions for Kleene’s Recursion Theorem (Q3455838) (← links)
- Efficient Well-Definedness Checking (Q3541692) (← links)
- Kleene’s Amazing Second Recursion Theorem (Q3644738) (← links)
- The Geometry of Negation (Q3647200) (← links)
- Natural well-orderings (Q3772212) (← links)
- ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE† (Q3916438) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- 1998 Spring Meeting of the Association for Symbolic Logic (Q4212937) (← links)
- The Mathematical Import of Zermelo's Well-Ordering Theorem (Q4372921) (← links)
- Process algebra with four-valued logic (Q4443411) (← links)
- Foreword: Three-valued logics and their applications (Q4583341) (← links)
- A 4-valued framework encompassing intuitionistic and classical logic (Q4583348) (← links)
- Knowledge compilation of logic programs using approximation fixpoint theory (Q4592990) (← links)
- AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX (Q4600826) (← links)
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM (Q4632541) (← links)
- GENERALIZATIONS OF THE RECURSION THEOREM (Q4647121) (← links)
- CONCEPTS ASSOCIATED TO CRITERIA: A METHOD FOR KNOWLEDGE PROCESSING FROM FUZZY CONTEXTS (Q4822681) (← links)
- The Mathematical Work of S.C.Kleene (Q4837673) (← links)
- 1994–1995 Winter Meeting of the Association for Symbolic Logic (Q4858810) (← links)
- A propositional logic with 4 values: true, false, divergent and meaningless (Q4868228) (← links)
- Logical Opposition and Collective Decisions (Q4915595) (← links)
- Non Truth-Functional Many-Valuedness (Q4916205) (← links)
- The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem (Q4917999) (← links)
- REFERENCE IN ARITHMETIC (Q4961744) (← links)
- A note on entropy of logic (Q4987702) (← links)
- (Q4997922) (← links)
- (Q4997950) (← links)
- (Q4999723) (← links)
- Normalisation for Some Quite Interesting Many-Valued Logics (Q5013635) (← links)
- … and so on: Schütte on Naming Ordinals (Q5013893) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- The Strict/Tolerant Idea and Bilattices (Q5020168) (← links)
- (Q5020543) (← links)
- (Q5021005) (← links)
- Memory limited inductive inference machines (Q5056125) (← links)
- Fixpoints and relative precompleteness (Q5075519) (← links)
- (Q5077350) (← links)