scientific article; zbMATH DE number 3577197

zbMath0371.02017MaRDI QIDQ4146722

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Descriptive set theory (03E15) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Hierarchies of computability and definability (03D55)

Related Items (only showing first 100 items - show all)

Generalized reduction theorems for model-theoretic analogs of the class of coanalytic sets ⋮ Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀p and ∃p ⋮ Infinite games in the Cantor space and subsystems of second order arithmetic ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ Primitive recursive equivalence relations and their primitive recursive complexity ⋮ THE POWER OF NAIVE TRUTH ⋮ Almost everywhere domination ⋮ Sets of real numbers closed under Turing equivalence: applications to fields, orders and automorphisms ⋮ Varieties of self-reference in metamathematics ⋮ Kolmogorov complexity and the geometry of Brownian motion ⋮ A Kripkean approach to unknowability and truth ⋮ Ultrafilter spaces on the semilattice of partitions ⋮ Complexity of Fractran and Productivity ⋮ The Operational Penumbra: Some Ontological Aspects ⋮ Analytic and coanalytic families of almost disjoint functions ⋮ A contextual-hierarchical approach to truth and the liar paradox ⋮ The independence of ⋮ Proof theory of reflection ⋮ The complexity of revision ⋮ Members of countable $\Pi ^ 0_ 1$ classes ⋮ A Survey of Mučnik and Medvedev Degrees ⋮ The polynomially exponential time restrained analytical hierarchy ⋮ An algebraic approach to categories of partial morphisms ⋮ Explicit mathematics with the monotone fixed point principle. II: Models ⋮ On the ‘definability of definable’ problem of Alfred Tarski, Part II ⋮ On the classification of computable languages ⋮ Effective discontinuity and a characterisation of the superjump ⋮ Power set recursion ⋮ The role of parameters in bar rule and bar induction ⋮ Bounds on Scott rank for various nonelementary classes ⋮ On the proof-theoretic strength of monotone induction in explicit mathematics ⋮ Towards a descriptive set theory for domain-like structures ⋮ Decision times of infinite computations ⋮ Levels of truth ⋮ Higher-order logic and disquotational truth ⋮ A completeness theorem for the expressive power of higher-order algebraic specifications ⋮ On fixpoint arithmetic and infinite time Turing machines ⋮ The realm of primitive recursion ⋮ Creativeness and completeness in recursion categories of partial recursive operators ⋮ Monotone inductive definitions in a constructive theory of functions and classes ⋮ The Galvin-Prikry theorem and set existence axioms ⋮ Structural properties for feasibly computable classes of type two ⋮ On the classification of recursive languages ⋮ Fine hierarchies and Boolean terms ⋮ Polymorphic extensions of simple type structures. With an application to a bar recursive minimization ⋮ An improved zero-one law for algorithmically random sequences ⋮ The expressiveness of locally stratified programs ⋮ Constructive Zermelo-Fraenkel set theory and the limited principle of omniscience ⋮ A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs ⋮ Rethinking revision ⋮ A Spector-Gandy theorem for cPC_d() classes ⋮ Levels of undecidability in rewriting ⋮ Counterexamples to countable-section $\varPi_2^1$ uniformization and $\varPi_3^1$ separation ⋮ Cores of Π₁¹ sets of reals ⋮ Inductive definability: Measure and category ⋮ The complexity of recursive constraint satisfaction problems ⋮ Non-recursiveness of the operations on real numbers ⋮ $$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$ ⋮ Learning Theory and Epistemology ⋮ The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories ⋮ A Suppes predicate for general relativity and set-theoretically generic spacetimes ⋮ Effectively closed sets and enumerations ⋮ Index Sets and Boolean Operations ⋮ Polynomial time operations in explicit mathematics ⋮ Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies ⋮ Arbitrary sequence RAMs ⋮ Uncomputability: The problem of induction internalized ⋮ Things that can and things that cannot be done in PRA ⋮ On external Scott algebras in nonstandard models of Peano arithmetic ⋮ On the time complexity of partial real functions ⋮ Inductively defined sets of reals ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Fine hierarchies and m-reducibilities in theoretical computer science ⋮ Higher-order equational logic for specification, simulation and testing ⋮ Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium) ⋮ Random numbers as probabilities of machine behavior ⋮ Measure theoretic approach to the classification of cellular automata ⋮ Computation, hypercomputation, and physical science ⋮ Fractals Generated by Algorithmically Random Brownian Motion ⋮ Dynamics of a generic Brownian motion: Recursive aspects ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ Transplendent models: expansions omitting a type ⋮ Decidability and definability with circumscription ⋮ On strictly arithmetical completeness in logics of programs ⋮ On the complexity of reasoning in Kleene algebra ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES ⋮ Arithmetical representations of Brownian motion I ⋮ On the upper semi-lattice of -degrees ⋮ Possible-worlds semantics for modal notions conceived as predicates ⋮ On the robustness of ALMOST-$\mathcal {R}$ ⋮ Fixpoints, games and the difference hierarchy ⋮ Degrees of Undecidability in Term Rewriting ⋮ The continuum hypothesis in intuitionism ⋮ Mass problems associated with effectively closed sets ⋮ Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers) ⋮ On the ranked points of a Π₁⁰ set ⋮ Systems of explicit mathematics with non-constructive $\mu$-operator and join ⋮ Index sets in computable analysis ⋮ On approximate and algebraic computability over the real numbers ⋮ Explicit mathematics with the monotone fixed point principle

This page was built for publication: