The following pages link to On notation for ordinal numbers (Q5772803):
Displaying 50 items.
- Many-valued dynamic object-oriented inheritance and approximations (Q2670890) (← links)
- The final cut (Q2679590) (← links)
- Neutral free logic: motivation, proof theory and models (Q2698548) (← links)
- Type-theoretic approaches to ordinals (Q2700785) (← links)
- Structural Operational Semantics with First-Order Logic (Q2810690) (← links)
- Two Problems for Sophistication (Q2835644) (← links)
- On the Computable Theory of Bounded Analytic Functions (Q2866157) (← links)
- Truth versus information in logic programming (Q2933087) (← links)
- Formalism and intuition in computability (Q2941588) (← links)
- From Turing machines to computer viruses (Q2941590) (← links)
- Trivial Dialetheism and the Logic of Paradox (Q2987757) (← links)
- 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)
