Theory of Formal Systems. (AM-47)
From MaRDI portal
Publication:3276696
DOI10.1515/9781400882007zbMath0097.24503OpenAlexW2562830775WikidataQ115919019 ScholiaQ115919019MaRDI QIDQ3276696
Publication date: 1961
Full work available at URL: https://doi.org/10.1515/9781400882007
Related Items
On recursive bounds for the exceptional values in speed-up, Deduction-preserving “recursive isomorphisms” between theories, Arithmetical definability and computational complexity, Uniform self-reference, Context-free languages and rudimentary attributes, Maximal theories, The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors, On some metamathematical results as properties of general systems, Program Size Complexity of Correction Grammars in the Ershov Hierarchy, Elementary functions and loop programs, Elementary realizability, From learning in the limit to stochastic finite learning, Learning a subclass of regular patterns in polynomial time, Automatic synthesis of logical models for order-sorted first-order theories, “Recursive isomorphism” and effectively extensible theories, On the Degrees of Index Sets, HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?, Unsolvable algorithmic problems for semigroups, groups and rings, Transfinite induction within Peano arithmetic, The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb, A Beginner's Guide to Mathematical Logic, Rudimentary relations and primitive recursion: A toolbox, The minimum oracle circuit size problem, The expressiveness of locally stratified programs, The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics, On Creative Sets and Indices of Partial Recursive Functions, Report on attainability of systems of identities, Subrecursiveness: Machine-independent notions of computability in restricted time and storage, Isomorphism Types of Index Sets of Partial Recursive Functions, What does logic have to tell us about mathematical proofs?, On approximately identifying concept classes in the limit, Decision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theory, A descriptive complexity approach to the linear hierarchy., A step towards absolute versions of metamathematical results, Complexity of algorithms and computations, The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation, The independence of control structures in abstract programming systems, On the relation provable equivalence and on partitions in effectively inseparable sets, A note on A.E. h-complex functions, A Survey on Universal Computably Enumerable Equivalence Relations, Isomorphism of lattices of recursively enumerable sets, Effectively Simple Sets, A Theorem on Productive Functions, The complexity of Presburger arithmetic with bounded quantifier alternation depth, Effective Inseparability for Sequences of Sets, Creative and Weakly Creative Sequences of r.e. Sets, Unnamed Item, A machine description and the hierarchy of initial Grzegorczyk classes, Positive rudimentarity of the graphs of Ackermann and Grzegorczyk, Learning recursive functions: A survey, Developments from enquiries into the learnability of the pattern languages from positive data, Rudimentary Languages and Second‐Order Logic, Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview, On universal pairs in the Ershov hierarchy, Unnamed Item, Distributional learning of parallel multiple context-free grammars, Rudimentary reductions revisited, Conceptual Confluence in 1936: Post and Turing, Frequency computation and bounded queries, Physical Computational Complexity and First-order Logic, An improved lower bound for the elementary theories of trees, Consistent and coherent learning with \(\delta \)-delay, The concept of truth in a finite universe, Semi-conservative reduction, Computably enumerable sets and related issues, WCS-analysis of the context-sensitive, Recursive function theory and numerical analysis, A state space approach to the finite automata, Logics for reasoning about cryptographic constructions, Counting modulo finite semigroups, Mit regulären Grundbegriffen definierbare Prädikate, Space-bounded reducibility among combinatorial problems, Bounded monotone recursion and multihead automata, The role of rudimentary relations in complexity theory, Rudimentary relations and stack languages, Are natural languages universal?, Bounded minimalisation and bounded counting in argument-bounded idc's, INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS, Feferman on Computability, Creativity and Effective Inseparability, Inductive inference of monotonic formal systems from positive data, The Pumping Lemma for Well-Nested Multiple Context-Free Languages, On Models of a Nondeterministic Computation, Time-space tradeoffs for satisfiability, Sequences Having an Effective Fixed-Point Property, Bounded arithmetic, proof complexity and two papers of Parikh, ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS, Extended Canonical Systems, Theory of symbolic expressions. I, Classes of Predictably Computable Functions, An inductive number-theoretic characterization of NP, Incremental concept learning for bounded data mining., Nonerasing, counting, and majority over the linear time hierarchy, The theory of recursive functions, approaching its centennial, Existential interpretation. II, Effective inseparability and its applications
