On the Forms of the Predicates in the Theory of Constructive Ordinals
From MaRDI portal
Publication:5839933
DOI10.2307/2371894zbMath0061.01003OpenAlexW2320296823MaRDI QIDQ5839933
Publication date: 1944
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2371894
Related Items
Kleene's Amazing Second Recursion Theorem, Recursive Functions and Intuitionistic Number Theory, Recursive Predicates and Quantifiers, A complete equational axiomatization for prefix iteration, Complementation of rational sets on scattered linear orderings of finite rank, Non-uniqueness at ω2 in Kleene'sO, Parsimony hierarchies for inductive inference, Logics of communication and change, Automata on linear orderings, Zur Theorie der konstruktiven Wohlordnungen, A generalization of ACP using Belnap's logic, Nonaxiomatisability of equivalences over finite state processes, The Mathematical Work of S.C.Kleene, Number theoretic concepts and recursive well-orderings, Terminal metric spaces of finitely branching and image finite linear processes, Nonnegative companion matrices and star-height of \(\mathbb{N}\)-rational series, Notes on the methodology of CCS and CSP, Termination modulo equations by abstract commutation with an application to iteration, Partially additive categories and flow-diagram semantics, Mehrsortige logische Systeme mit unendlich langen Formeln I, Hierarchies of number-theoretic predicates, Recursive well-orderings, The power of reachability testing for timed automata, The multiplicative fragment of the Yanov equational theory, Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata., Divide and congruence: from decomposition of modal formulas to preservation of branching and \(\eta \)-bisimilarity, A Hierarchy Based on a Type Two Object, Learning with ordinal-bounded memory from positive data, Computability and Recursion, Models of nondeterministic regular expressions, Toward a theory of intelligence, Fast growing functions based on Ramsey theorems, Formulas, regular languages and Boolean circuits, Transfinite recursive progressions of axiomatic theories, Incompleteness along paths in progressions of theories, A coalgebraic approach to Kleene algebra with tests, Practical decidability, Regular subsets in semi-direct products of monoids, On the complexity of reasoning in Kleene algebra, Extensions of rooted trees and their applications, Singularities of rational functions and minimal factorizations: the noncommutative and the commutative setting, The memory orders of states of an automaton, Learning correction grammars, Stimulus-response theory of inite automata, Rice and Rice-Shapiro Theorems for transfinite correction grammars, Arithmetical Predicates and Function Quantifiers, Kleene’s Amazing Second Recursion Theorem, Plex languages, Turing oracle machines, online computing, and three displacements in computability theory, Extracting symbolic knowledge from recurrent neural networks -- a fuzzy logic approach, Characterizations of locally testable events, Language preorder as a precongruence, Frontier between decidability and undecidability: A survey, On the interpretation of intuitionistic number theory, On the notational independence of various hierarchies of degrees of unsolvability, Recursive Functions and Intuitionistic Number Theory, Modelization of deterministic rational relations, Paths in Kleene's0
