Recursive Predicates and Quantifiers
From MaRDI portal
Cites work
- A note on recursive functions
- A Theory of Positive Integers in Formal Logic. Part I
- An Unsolvable Problem of Elementary Number Theory
- General recursive functions of natural numbers
- Gödel Theorems for Non-Constructive Logics
- scientific article; zbMATH DE number 3024905 (Why is no real title available?)
- scientific article; zbMATH DE number 3032487 (Why is no real title available?)
- scientific article; zbMATH DE number 3106607 (Why is no real title available?)
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On notation for ordinal numbers
- On the Forms of the Predicates in the Theory of Constructive Ordinals
- On undecidable statements in enlarged systems of logic and the concept of truth
- Some aspects of the problem of mathematical rigor
- Some Properties of Conversion
- Systems of Logic Based on Ordinals†
- The constructive second number class
- The inconsistency of certain formal logics
- The inconsistency of certain formal logics
Cited in
(82)- Exotic quantifiers, complexity classes, and complete problems
- Turing oracle machines, online computing, and three displacements in computability theory
- Effective topological spaces. I: A definability theory
- The minimum degree of recursively representable choice functions
- Effective topological spaces. II: A hierarchy
- Some quantifiers require two-predicate scopes
- Effective topological spaces. III: Forcing and definability
- Simplicity, immunity, relativizations and nondeterminism
- Index sets related to prompt simplicity
- Characterizing parallel hierarchies by reducibilities
- A second step toward the polynomial hierarchy
- Index sets and presentations of complexity classes
- Toward a theory of intelligence
- The never-ending recursion
- Recursion-theoretic ranking and compression
- On the hardness of analyzing probabilistic programs
- Definability, decidability, complexity
- Gödel's reception of Turing's model of computability: the shift of perception in 1934
- Péter on Church's thesis, constructivity and computers
- Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy
- Parametric Church's thesis: synthetic computability without choice
- Using computability to measure complexity of algebraic structures and classes of structures
- Computable permutations and word problems
- Levy and set theory
- The many forms of hypercomputation
- Automata theory and control theory - a rapprochement
- The use of lists in the study of undecidable problems in automata theory
- On the realizations of predicate formulas
- Bemerkung über die Primpolynomzerlegung in endlich vielen Schritten
- Zur Theorie der konstruktiven Wohlordnungen
- Can Church's thesis be viewed as a Carnapian explication?
- Formalism and intuition in computability
- On the hardness of almost-sure termination
- On the degree spectrum of a ^0_1 class
- The metamathematics of Stable Ramsey’s Theorem for Pairs
- Arithmetical Predicates and Function Quantifiers
- Hierarchies of number-theoretic predicates
- Recursive and Recursively Enumerable Orders
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$
- My Life as a Logician
- Hyperarithmetical Sets
- Leon Henkin the reviewer
- Kleene’s Amazing Second Recursion Theorem
- A second step toward the strong polynomial-time hierarchy
- The theory of recursive functions, approaching its centennial
- Computation as an unbounded process
- All Quantifiers Versus the Quantifier All
- Conceptual Confluence in 1936: Post and Turing
- Theses for computation and recursion on concrete and abstract structures
- Why Turing’s Thesis Is Not a Thesis
- Multi-buffer simulations for trace language inclusion
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Classes of Polish spaces under effective Borel isomorphism
- The Church-Turing Thesis over Arbitrary Domains
- Darstellungen der (im KALMÁR-CSILLAG'schen Sinne) Elementaren Funktionen
- Recursive Functions and Intuitionistic Number Theory
- Existential Definability in Arithmetic
- Propositional Calculus and Realizability
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Recursive Functions and Intuitionistic Number Theory
- Productive Sets
- A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
- Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic
- The incompleteness theorems after 70 years
- An effectively closed set with no join property*
- Specification and verification of concurrent systems by causality and realizability
- Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability
- Levels of undecidability in rewriting
- Intermediate logics and the de Jongh property
- An analysis of Tennenbaum's theorem in constructive type theory
- Theoretical computer science: computability, decidability and logic
- Iterated priority arguments in descriptive set theory
- Elementary quantum recursion schemes that capture quantum polylogarithmic-time computability of quantum functions
- How to approximate fuzzy sets: mind-changes and the Ershov hierarchy
- The Kleene-Post and Post's theorem in the calculus of inductive constructions
- ``Upon this quote I will build my Church thesis
- On effective convergence in Fekete's lemma and related combinatorial problems in information theory
- A calculus for the specification, design, and verification of distributed concurrent systems
- The arithmetic hierarchy of real functions
- On simplicity of formulas
- Computing degrees of unsolvability
- An enumeration of the primitive recursive functions without repetition
This page was built for publication: Recursive Predicates and Quantifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5843994)
