On notation for ordinal numbers
From MaRDI portal
Publication:5772803
DOI10.2307/2267778zbMath0020.33803OpenAlexW2036869460WikidataQ29544450 ScholiaQ29544450MaRDI QIDQ5772803
Publication date: 1938
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2267778
Related Items
Convex MV-algebras: many-valued logics meet decision theory ⋮ On elementary theories of ordinal notation systems based on reflection principles ⋮ Kleene's Amazing Second Recursion Theorem ⋮ Correspondence analysis for some fragments of classical propositional logic ⋮ Kleene's three-valued logic and process algebra ⋮ Effectivity Questions for Kleene’s Recursion Theorem ⋮ Effectivity questions for Kleene's recursion theorem ⋮ Monoids of non-halting programs with tests ⋮ Fast three-valued abstract bit-vector arithmetic ⋮ Program Size Complexity of Correction Grammars in the Ershov Hierarchy ⋮ CONCEPTS ASSOCIATED TO CRITERIA: A METHOD FOR KNOWLEDGE PROCESSING FROM FUZZY CONTEXTS ⋮ Zur Theorie der konstruktiven Wohlordnungen ⋮ A generalization of ACP using Belnap's logic ⋮ Basic intuitionistic principles in fuzzy set theories and its extensions (a terminological debate on Atanassov IFS) ⋮ Truth versus information in logic programming ⋮ Generic Kleene fixed point theorem ⋮ The Mathematical Work of S.C.Kleene ⋮ Formalism and intuition in computability ⋮ From Turing machines to computer viruses ⋮ Three-valued logics in modal logic ⋮ Foreword: Three-valued logics and their applications ⋮ A 4-valued framework encompassing intuitionistic and classical logic ⋮ Many-valued dynamic object-oriented inheritance and approximations ⋮ On fixed-point theorems in synthetic computability ⋮ Russell and his sources for non-classical logics ⋮ An algebraic view of super-Belnap logics ⋮ Fuzzy power sets and fuzzy implication operators ⋮ Hierarchies of number-theoretic predicates ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ The never-ending recursion ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ The final cut ⋮ Natural deduction for Fitting's four-valued generalizations of Kleene's logics ⋮ Unnamed Item ⋮ Natural well-orderings ⋮ Fixpoint semantics for active integrity constraints ⋮ 1994–1995 Winter Meeting of the Association for Symbolic Logic ⋮ An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems ⋮ Inversive meadows and divisive meadows ⋮ AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX ⋮ A propositional logic with 4 values: true, false, divergent and meaningless ⋮ The independence of control structures in abstract programming systems ⋮ Neutral free logic: motivation, proof theory and models ⋮ Type-theoretic approaches to ordinals ⋮ Semantic games with chance moves revisited: from IF logic to partial logic ⋮ Trivial Dialetheism and the Logic of Paradox ⋮ On the Semantics of Intensionality ⋮ Efficient Well-Definedness Checking ⋮ On the characterizations of fuzzy implications satisfying \(I(x,I(y,z))=I(I(x,y),I(x,z))\) ⋮ On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species ⋮ NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM ⋮ Hyperarithmetical Sets ⋮ Why Post Did [Not Have Turing’s Thesis] ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You ⋮ Belnap's logic and conditional composition ⋮ The Mathematical Import of Zermelo's Well-Ordering Theorem ⋮ Stone-type representations and dualities for varieties of bisemilattices ⋮ Remarks on the development of computability ⋮ Wave-particle duality and the objectiveness of ``true and ``false ⋮ GENERALIZATIONS OF THE RECURSION THEOREM ⋮ Logical Opposition and Collective Decisions ⋮ Non Truth-Functional Many-Valuedness ⋮ Things that can be made into themselves ⋮ The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem ⋮ A calculus for four-valued sequential logic ⋮ Limitwise monotonic functions relative to the Kleene's ordinal notation system ⋮ A many-valued semantics for category mistakes ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Facts and the semantics of gerunds ⋮ Efficient linear orders ⋮ Computable linear orders and limitwise monotonic functions ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ An \(n\)-player semantic game for an \(n+1\)-valued logic ⋮ REFERENCE IN ARITHMETIC ⋮ Process algebra with four-valued logic ⋮ Structural Operational Semantics with First-Order Logic ⋮ Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics ⋮ Missing values and dragonfly operations in fuzzy relational compositions ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Arithmetical Predicates and Function Quantifiers ⋮ Key notions of Tarski's methodology of deductive systems ⋮ Kleene’s Amazing Second Recursion Theorem ⋮ On interpreting Chaitin's incompleteness theorem ⋮ The Geometry of Negation ⋮ Infinite time extensions of Kleene's \({\mathcal O}\) ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ A note on entropy of logic ⋮ ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE† ⋮ Two Problems for Sophistication ⋮ The noneffectivity of Arslanov's completeness criterion and related theorems ⋮ 1998 Spring Meeting of the Association for Symbolic Logic ⋮ Concept lattices defined from implication operators ⋮ Recursive Functions Over Well Ordered Partial Orderings ⋮ Constructive Versions of Ordinal Number Classes ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Molecular dynamics ⋮ Intensional Kleene and Rice theorems for abstract program semantics ⋮ Local higher-order fixpoint iteration ⋮ Process algebra and conditional composition ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property ⋮ New Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers* ⋮ Propositional Calculus and Realizability ⋮ THE LATTICE OF SUPER-BELNAP LOGICS ⋮ Classes of Recursively Enumerable Sets and Their Decision Problems ⋮ On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Specht property for the algebra of upper triangular matrices of size two with a Taft’s algebra action ⋮ Boolean elements in Lukasiewicz algebras, I ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ Recursive Predicates and Quantifiers ⋮ Memory limited inductive inference machines ⋮ Non-uniqueness at ω2 in Kleene'sO ⋮ Fixpoints and relative precompleteness ⋮ Is there a neutral metalanguage? ⋮ GÖDEL ON MANY-VALUED LOGIC ⋮ Extremal numberings and fixed point theorems ⋮ Unnamed Item ⋮ Stalnakerian connexive logics ⋮ Unnamed Item ⋮ A classification of low c.e. sets and the Ershov hierarchy ⋮ On the three-valued expansions of Kleene's logic ⋮ Non-transitive correspondence analysis ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Belief change and 3-valued logics: Characterization of 19,683 belief change operators ⋮ REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS ⋮ Computability and Recursion ⋮ Diagonalisation and Church's Thesis: Kleene's Homework ⋮ On Minimal and Almost-Minimal Systems of Notations ⋮ Hierarchies in Recursive Function Theory ⋮ (S,N)-Implications on Bounded Lattices ⋮ Stability, Supportedness, Minimality and Kleene Answer Set Programs ⋮ Non-deterministic structures of computation ⋮ Proclus and the Neoplatonic syllogistic ⋮ Semantical analysis of weak Kleene logics ⋮ On Vidal's trivalent explanations for defective conditional in mathematics ⋮ Unnamed Item ⋮ A comparison of identification criteria for inductive inference of recursive real-valued functions ⋮ Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis ⋮ THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES ⋮ Normalisation for Some Quite Interesting Many-Valued Logics ⋮ … and so on: Schütte on Naming Ordinals ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS ⋮ A Generalization of ACP Using Belnap's Logic ⋮ The Strict/Tolerant Idea and Bilattices ⋮ Recursive Functions and Intuitionistic Number Theory ⋮ Axiomatization of if-then-else over possibly non-halting programs and tests
Cites Work
