On notation for ordinal numbers

From MaRDI portal
Publication:5772803

DOI10.2307/2267778zbMath0020.33803OpenAlexW2036869460WikidataQ29544450 ScholiaQ29544450MaRDI QIDQ5772803

Stephen C. Kleene

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 theoryOn elementary theories of ordinal notation systems based on reflection principlesKleene's Amazing Second Recursion TheoremCorrespondence analysis for some fragments of classical propositional logicKleene's three-valued logic and process algebraEffectivity Questions for Kleene’s Recursion TheoremEffectivity questions for Kleene's recursion theoremMonoids of non-halting programs with testsFast three-valued abstract bit-vector arithmeticProgram Size Complexity of Correction Grammars in the Ershov HierarchyCONCEPTS ASSOCIATED TO CRITERIA: A METHOD FOR KNOWLEDGE PROCESSING FROM FUZZY CONTEXTSZur Theorie der konstruktiven WohlordnungenA generalization of ACP using Belnap's logicBasic intuitionistic principles in fuzzy set theories and its extensions (a terminological debate on Atanassov IFS)Truth versus information in logic programmingGeneric Kleene fixed point theoremThe Mathematical Work of S.C.KleeneFormalism and intuition in computabilityFrom Turing machines to computer virusesThree-valued logics in modal logicForeword: Three-valued logics and their applicationsA 4-valued framework encompassing intuitionistic and classical logicMany-valued dynamic object-oriented inheritance and approximationsOn fixed-point theorems in synthetic computabilityRussell and his sources for non-classical logicsAn algebraic view of super-Belnap logicsFuzzy power sets and fuzzy implication operatorsHierarchies of number-theoretic predicatesGrounded fixpoints and their applications in knowledge representationThe never-ending recursionKnowledge compilation of logic programs using approximation fixpoint theoryThe final cutNatural deduction for Fitting's four-valued generalizations of Kleene's logicsUnnamed ItemNatural well-orderingsFixpoint semantics for active integrity constraints1994–1995 Winter Meeting of the Association for Symbolic LogicAn algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systemsInversive meadows and divisive meadowsAUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOXA propositional logic with 4 values: true, false, divergent and meaninglessThe independence of control structures in abstract programming systemsNeutral free logic: motivation, proof theory and modelsType-theoretic approaches to ordinalsSemantic games with chance moves revisited: from IF logic to partial logicTrivial Dialetheism and the Logic of ParadoxOn the Semantics of IntensionalityEfficient Well-Definedness CheckingOn 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 speciesNOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISMHyperarithmetical SetsWhy Post Did [Not Have Turing’s Thesis] ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for YouBelnap's logic and conditional compositionThe Mathematical Import of Zermelo's Well-Ordering TheoremStone-type representations and dualities for varieties of bisemilatticesRemarks on the development of computabilityWave-particle duality and the objectiveness of ``true and ``falseGENERALIZATIONS OF THE RECURSION THEOREMLogical Opposition and Collective DecisionsNon Truth-Functional Many-ValuednessThings that can be made into themselvesThe Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness TheoremA calculus for four-valued sequential logicLimitwise monotonic functions relative to the Kleene's ordinal notation systemA many-valued semantics for category mistakesMind change complexity of inferring unbounded unions of restricted pattern languages from positive dataFacts and the semantics of gerundsEfficient linear ordersComputable linear orders and limitwise monotonic functionsThe Role of True Finiteness in the Admissible Recursively Enumerable DegreesAn \(n\)-player semantic game for an \(n+1\)-valued logicREFERENCE IN ARITHMETICProcess algebra with four-valued logicStructural Operational Semantics with First-Order LogicBivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logicsMissing values and dragonfly operations in fuzzy relational compositionsRice and Rice-Shapiro Theorems for transfinite correction grammarsArithmetical Predicates and Function QuantifiersKey notions of Tarski's methodology of deductive systemsKleene’s Amazing Second Recursion TheoremOn interpreting Chaitin's incompleteness theoremThe Geometry of NegationInfinite time extensions of Kleene's \({\mathcal O}\)Turing oracle machines, online computing, and three displacements in computability theoryA note on entropy of logicISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†Two Problems for SophisticationThe noneffectivity of Arslanov's completeness criterion and related theorems1998 Spring Meeting of the Association for Symbolic LogicConcept lattices defined from implication operatorsRecursive Functions Over Well Ordered Partial OrderingsConstructive Versions of Ordinal Number ClassesOn the Computable Theory of Bounded Analytic FunctionsMolecular dynamicsIntensional Kleene and Rice theorems for abstract program semanticsLocal higher-order fixpoint iterationProcess algebra and conditional compositionP.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence PropertyNew Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers*Propositional Calculus and RealizabilityTHE LATTICE OF SUPER-BELNAP LOGICSClasses of Recursively Enumerable Sets and Their Decision ProblemsOn Well-Founded Set-Inductions and Locally Monotone OperatorsSpecht property for the algebra of upper triangular matrices of size two with a Taft’s algebra actionBoolean elements in Lukasiewicz algebras, IRecursive Functions and Intuitionistic Number TheoryRecursive Predicates and QuantifiersMemory limited inductive inference machinesNon-uniqueness at ω2 in Kleene'sOFixpoints and relative precompletenessIs there a neutral metalanguage?GÖDEL ON MANY-VALUED LOGICExtremal numberings and fixed point theoremsUnnamed ItemStalnakerian connexive logicsUnnamed ItemA classification of low c.e. sets and the Ershov hierarchyOn the three-valued expansions of Kleene's logicNon-transitive correspondence analysisClasses of Polish spaces under effective Borel isomorphismUnnamed ItemUnnamed ItemBelief change and 3-valued logics: Characterization of 19,683 belief change operatorsREXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICSComputability and RecursionDiagonalisation and Church's Thesis: Kleene's HomeworkOn Minimal and Almost-Minimal Systems of NotationsHierarchies in Recursive Function Theory(S,N)-Implications on Bounded LatticesStability, Supportedness, Minimality and Kleene Answer Set ProgramsNon-deterministic structures of computationProclus and the Neoplatonic syllogisticSemantical analysis of weak Kleene logicsOn Vidal's trivalent explanations for defective conditional in mathematicsUnnamed ItemA comparison of identification criteria for inductive inference of recursive real-valued functionsAutomated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence AnalysisTHE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREESNormalisation for Some Quite Interesting Many-Valued Logics… and so on: Schütte on Naming OrdinalsORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRASA Generalization of ACP Using Belnap's LogicThe Strict/Tolerant Idea and BilatticesRecursive Functions and Intuitionistic Number TheoryAxiomatization of if-then-else over possibly non-halting programs and tests



Cites Work