On notation for ordinal numbers
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- An \(n\)-player semantic game for an \(n+1\)-valued logic
- Infinite time extensions of Kleene's \({\mathcal O}\)
- Turing oracle machines, online computing, and three displacements in computability theory
- Fuzzy power sets and fuzzy implication operators
- The independence of control structures in abstract programming systems
- A many-valued semantics for category mistakes
- Facts and the semantics of gerunds
- Efficient linear orders
- On interpreting Chaitin's incompleteness theorem
- On dynamically non-trivial three-valued logics: Oscillatory and bifurcatory species
- Concept lattices defined from implication operators
- Process algebra and conditional composition
- Convex MV-algebras: many-valued logics meet decision theory
- Monoids of non-halting programs with tests
- On fixed-point theorems in synthetic computability
- An algebraic view of super-Belnap logics
- The never-ending recursion
- Natural deduction for Fitting's four-valued generalizations of Kleene's logics
- Fixpoint semantics for active integrity constraints
- On the characterizations of fuzzy implications satisfying \(I(x,I(y,z))=I(I(x,y),I(x,z))\)
- Stone-type representations and dualities for varieties of bisemilattices
- Key notions of Tarski's methodology of deductive systems
- Molecular dynamics
- Russell and his sources for non-classical logics
- Computable linear orders and limitwise monotonic functions
- Intensional Kleene and Rice theorems for abstract program semantics
- Local higher-order fixpoint iteration
- Fast three-valued abstract bit-vector arithmetic
- Wave-particle duality and the objectiveness of ``true and ``false
- Things that can be made into themselves
- Limitwise monotonic functions relative to the Kleene's ordinal notation system
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Missing values and dragonfly operations in fuzzy relational compositions
- Generic Kleene fixed point theorem
- Semantic games with chance moves revisited: from IF logic to partial logic
- Belnap's logic and conditional composition
- Effectivity questions for Kleene's recursion theorem
- Zur Theorie der konstruktiven Wohlordnungen
- Many-valued dynamic object-oriented inheritance and approximations
- The final cut
- Neutral free logic: motivation, proof theory and models
- Type-theoretic approaches to ordinals
- On elementary theories of ordinal notation systems based on reflection principles
- Structural operational semantics with first-order logic
- Two Problems for Sophistication
- On the Computable Theory of Bounded Analytic Functions
- Truth versus information in logic programming
- Kleene's three-valued logic and process algebra
- Formalism and intuition in computability
- From Turing machines to computer viruses
- Trivial Dialetheism and the Logic of Paradox
- On the semantics of intensionality
- Rice and Rice-Shapiro theorems for transfinite correction grammars
- Kleene's amazing second recursion theorem
- Program size complexity of correction grammars in the Ershov hierarchy
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- Recursive Functions Over Well Ordered Partial Orderings
- Constructive Versions of Ordinal Number Classes
- 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
- Remarks on the development of computability
- The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
- Effectivity questions for Kleene's recursion theorem
- Efficient Well-Definedness Checking
- Kleene’s Amazing Second Recursion Theorem
- The geometry of negation
- Natural well-orderings
- Three-valued logics in modal logic
- ISOMORPHISMS OF SPENCER-BROWN'S LAWS OF FORM AND VARELA'S CALCULUS FOR SELF-REFERENCE†
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- Inversive meadows and divisive meadows
- 1998 Spring Meeting of the Association for Symbolic Logic
- The Mathematical Import of Zermelo's Well-Ordering Theorem
- Process algebra with four-valued logic
- Foreword: three-valued logics and their applications
- A 4-valued framework encompassing intuitionistic and classical logic
- Knowledge compilation of logic programs using approximation fixpoint theory
- Automated correspondence analysis for the binary extensions of the logic of paradox
- NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM
- GENERALIZATIONS OF THE RECURSION THEOREM
- CONCEPTS ASSOCIATED TO CRITERIA: A METHOD FOR KNOWLEDGE PROCESSING FROM FUZZY CONTEXTS
- The Mathematical Work of S.C.Kleene
- 1994–1995 Winter Meeting of the Association for Symbolic Logic
- A propositional logic with 4 values: true, false, divergent and meaningless
- Logical opposition and collective decisions
- Non Truth-Functional Many-Valuedness
- The axiom system \(\mathrm{I}\Sigma_{0}\) manages to simultaneously obey and evade the Herbrandized version of the second incompleteness theorem
- Reference in arithmetic
- A note on entropy of logic
- Natural deduction for Yuriev's logic
- Correspondence analysis for logic of rational agent
- Natural deduction systems for some modifications of Kleene's and Dunn-Belnap's logics
- Normalisation for some quite interesting many-valued logics
- … and so on: Schütte on Naming Ordinals
- Ordinal analysis of partial combinatory algebras
- The strict/tolerant idea and bilattices
- A three-valued semantics for typed logic programming
- scientific article; zbMATH DE number 7455743 (Why is no real title available?)
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)
