On notation for ordinal numbers
From MaRDI portal
Publication:5772803
Cites work
Cited in
(only showing first 100 items - show all)- Propositional Calculus and Realizability
- ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†
- Axiomatization of if-then-else over possibly non-halting programs and tests
- Memory limited inductive inference machines
- The final cut
- The strict/tolerant idea and bilattices
- Modeling and shadowing paraconsistent BDI agents
- Russell and his sources for non-classical logics
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Turing oracle machines, online computing, and three displacements in computability theory
- Many-valued dynamic object-oriented inheritance and approximations
- The geometry of negation
- The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
- New Foundations for Imperative Logic I: Logical Connectives, Consistency, and Quantifiers*
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
- Propositional type theory of indeterminacy
- A 4-valued framework encompassing intuitionistic and classical logic
- Trivial Dialetheism and the Logic of Paradox
- Natural well-orderings
- Belnap's logic and conditional composition
- Fixpoints and relative precompleteness
- On fixed-point theorems in synthetic computability
- Recursive Functions and Intuitionistic Number Theory
- A Uniform Formalisation of Three-Valued Logics in Bisequent Calculus
- … and so on: Schütte on Naming Ordinals
- Belief change and 3-valued logics: characterization of 19,683 belief change operators
- The noneffectivity of Arslanov's completeness criterion and related theorems
- K3, Ł3, LP, RM3, A3, FDE, M: how to make many-valued logics work for you
- The never-ending recursion
- Ordinal analysis of partial combinatory algebras
- A generalization of ACP using Belnap's logic
- Molecular dynamics
- Natural deduction for Yuriev's logic
- GENERALIZATIONS OF THE RECURSION THEOREM
- On the semantics of intensionality
- Key notions of Tarski's methodology of deductive systems
- Normalisation for some infectious logics and their relatives
- Correspondence analysis for some fragments of classical propositional logic
- Structural operational semantics with first-order logic
- Missing values and dragonfly operations in fuzzy relational compositions
- On trivalent logics, probabilistic weak deduction theorems, and a general import-export principle
- Recursive Functions and Intuitionistic Number Theory
- Three-valued logics in modal logic
- On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species
- A many-valued semantics for category mistakes
- Neutral free logic: motivation, proof theory and models
- scientific article; zbMATH DE number 7528815 (Why is no real title available?)
- Non-deterministic structures of computation
- Reference in arithmetic
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Facts and the semantics of gerunds
- Efficient linear orders
- Diagonalisation and Church's Thesis: Kleene's Homework
- Efficient Well-Definedness Checking
- Generic Kleene fixed point theorem
- Rice and Rice-Shapiro theorems for transfinite correction grammars
- (\(S,N\))-implications on bounded lattices
- Two Problems for Sophistication
- Zur Theorie der konstruktiven Wohlordnungen
- The Mathematical Import of Zermelo's Well-Ordering Theorem
- Semantical analysis of weak Kleene logics
- Stalnakerian connexive logics
- Type-theoretic approaches to ordinals
- Why post did [not] have Turing's thesis
- Procedural semantics and its relevance to paradox
- Process algebra with four-valued logic
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
- 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
- Wave-particle duality and the objectiveness of ``true and ``false
- An algebraic expression of finite horizon optimal control algorithm for stochastic logical dynamical systems
- Semantic games with chance moves revisited: from IF logic to partial logic
- On Vidal's trivalent explanations for defective conditional in mathematics
- Formalism and intuition in computability
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- Recursive Functions Over Well Ordered Partial Orderings
- REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
- On the three-valued expansions of Kleene's logic
- Stability, supportedness, minimality and Kleene answer set programs
- Convex MV-algebras: many-valued logics meet decision theory
- On interpreting Chaitin's incompleteness theorem
- On Minimal and Almost-Minimal Systems of Notations
- Natural deduction systems for some modifications of Kleene's and Dunn-Belnap's logics
- Non-uniqueness at ω2 in Kleene'sO
- On elementary theories of ordinal notation systems based on reflection principles
- A calculus for four-valued sequential logic
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- Proclus and the Neoplatonic syllogistic
- The Mathematical Work of S.C.Kleene
- Classes of Polish spaces under effective Borel isomorphism
- An algebraic view of super-Belnap logics
- On the characterizations of fuzzy implications satisfying \(I(x,I(y,z))=I(I(x,y),I(x,z))\)
- A note on entropy of logic
- Hyperarithmetical Sets
- A propositional logic with 4 values: true, false, divergent and meaningless
- Kleene's amazing second recursion theorem
- Recursive Predicates and Quantifiers
- Non-transitive correspondence analysis
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)