On notation for ordinal numbers
From MaRDI portal
Publication:5772803
DOI10.2307/2267778zbMATH Open0020.33803OpenAlexW2036869460WikidataQ29544450 ScholiaQ29544450MaRDI QIDQ5772803FDOQ5772803
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
Cites Work
Cited In (only showing first 100 items - show all)
- Process algebra with four-valued logic
- On the Semantics of Intensionality
- Wave-particle duality and the objectiveness of ``true and ``false
- An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- Formalism and intuition in computability
- On interpreting Chaitin's incompleteness theorem
- The Strict/Tolerant Idea and Bilattices
- The Mathematical Work of S.C.Kleene
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- A calculus for four-valued sequential logic
- On elementary theories of ordinal notation systems based on reflection principles
- The Axiom System IΣ0 Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem
- Recursive Predicates and Quantifiers
- A propositional logic with 4 values: true, false, divergent and meaningless
- On the characterizations of fuzzy implications satisfying \(I(x,I(y,z))=I(I(x,y),I(x,z))\)
- An algebraic view of super-Belnap logics
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- Basic intuitionistic principles in fuzzy set theories and its extensions (a terminological debate on Atanassov IFS)
- Extremal numberings and fixed point theorems
- A generalization of ACP using Belnap's logic
- Kleene’s Amazing Second Recursion Theorem
- Boolean elements in Lukasiewicz algebras, I
- Kleene's three-valued logic and process algebra
- The independence of control structures in abstract programming systems
- Computability and Recursion
- From Turing machines to computer viruses
- Inversive meadows and divisive meadows
- Constructive Versions of Ordinal Number Classes
- Knowledge compilation of logic programs using approximation fixpoint theory
- Non Truth-Functional Many-Valuedness
- An \(n\)-player semantic game for an \(n+1\)-valued logic
- THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
- Process algebra and conditional composition
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Title not available (Why is that?)
- Hierarchies in Recursive Function Theory
- Fuzzy power sets and fuzzy implication operators
- Concept lattices defined from implication operators
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS
- 1998 Spring Meeting of the Association for Symbolic Logic
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- REFERENCE IN ARITHMETIC
- Propositional Calculus and Realizability
- Grounded fixpoints and their applications in knowledge representation
- Axiomatization of if-then-else over possibly non-halting programs and tests
- Memory limited inductive inference machines
- Kleene's Amazing Second Recursion Theorem
- The final cut
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Turing oracle machines, online computing, and three displacements in computability theory
- (S,N)-Implications on Bounded Lattices
- New Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers*
- Natural well-orderings
- Belnap's logic and conditional composition
- Recursive Functions and Intuitionistic Number Theory
- The noneffectivity of Arslanov's completeness criterion and related theorems
- Title not available (Why is that?)
- GENERALIZATIONS OF THE RECURSION THEOREM
- Molecular dynamics
- AUTOMATED CORRESPONDENCE ANALYSIS FOR THE BINARY EXTENSIONS OF THE LOGIC OF PARADOX
- Key notions of Tarski's methodology of deductive systems
- Structural operational semantics with first-order logic
- Foreword: Three-valued logics and their applications
- Correspondence analysis for some fragments of classical propositional logic
- Three-valued logics in modal logic
- On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species
- A many-valued semantics for category mistakes
- Non-deterministic structures of computation
- Automated Proof-searching for Strong Kleene Logic and its Binary Extensions via Correspondence Analysis
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Diagonalisation and Church's Thesis: Kleene's Homework
- Efficient Well-Definedness Checking
- Facts and the semantics of gerunds
- Efficient linear orders
- Generic Kleene fixed point theorem
- The Mathematical Import of Zermelo's Well-Ordering Theorem
- Semantical analysis of weak Kleene logics
- Zur Theorie der konstruktiven Wohlordnungen
- Procedural semantics and its relevance to paradox
- Normalisation for Some Quite Interesting Many-Valued Logics
- Type-theoretic approaches to ordinals
- Logical Opposition and Collective Decisions
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
- K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You
- Intensional Kleene and Rice theorems for abstract program semantics
- Local higher-order fixpoint iteration
- Limitwise monotonic functions relative to the Kleene's ordinal notation system
- On Vidal's trivalent explanations for defective conditional in mathematics
- Semantic games with chance moves revisited: from IF logic to partial logic
- REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
- On the three-valued expansions of Kleene's logic
- Recursive Functions Over Well Ordered Partial Orderings
- On Minimal and Almost-Minimal Systems of Notations
- Convex MV-algebras: many-valued logics meet decision theory
- On Well-Founded Set-Inductions and Locally Monotone Operators
- Non-uniqueness at ω2 in Kleene'sO
- Proclus and the Neoplatonic syllogistic
- Classes of Polish spaces under effective Borel isomorphism
This page was built for publication: On notation for ordinal numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5772803)