Theory of Formal Systems. (AM-47)

From MaRDI portal
Revision as of 11:17, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3276696

DOI10.1515/9781400882007zbMath0097.24503OpenAlexW2562830775WikidataQ115919019 ScholiaQ115919019MaRDI QIDQ3276696

Raymond M. Smullyan

Publication date: 1961

Full work available at URL: https://doi.org/10.1515/9781400882007




Related Items (96)

On recursive bounds for the exceptional values in speed-upDeduction-preserving “recursive isomorphisms” between theoriesArithmetical definability and computational complexityUniform self-referenceContext-free languages and rudimentary attributesMaximal theoriesThe 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processorsOn some metamathematical results as properties of general systemsProgram Size Complexity of Correction Grammars in the Ershov HierarchyElementary functions and loop programsElementary realizabilityFrom learning in the limit to stochastic finite learningLearning a subclass of regular patterns in polynomial timeAutomatic synthesis of logical models for order-sorted first-order theories“Recursive isomorphism” and effectively extensible theoriesOn the Degrees of Index SetsHOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM?Unsolvable algorithmic problems for semigroups, groups and ringsTransfinite induction within Peano arithmeticThe absorption law. Or: how to Kreisel a Hilbert-Bernays-LöbA Beginner's Guide to Mathematical LogicRudimentary relations and primitive recursion: A toolboxThe minimum oracle circuit size problemThe expressiveness of locally stratified programsThe categorical and the hypothetical: a critique of some fundamental assumptions of standard semanticsOn Creative Sets and Indices of Partial Recursive FunctionsReport on attainability of systems of identitiesSubrecursiveness: Machine-independent notions of computability in restricted time and storageIsomorphism Types of Index Sets of Partial Recursive FunctionsWhat does logic have to tell us about mathematical proofs?On approximately identifying concept classes in the limitDecision procedures for elementary sublanguages of set theory IX. Unsolvability of the decision problem for a restricted subclass of the Δ0-formulas in set theoryA descriptive complexity approach to the linear hierarchy.A step towards absolute versions of metamathematical resultsComplexity of algorithms and computationsThe Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic InnovationThe independence of control structures in abstract programming systemsOn the relation provable equivalence and on partitions in effectively inseparable setsA note on A.E. h-complex functionsA Survey on Universal Computably Enumerable Equivalence RelationsIsomorphism of lattices of recursively enumerable setsEffectively Simple SetsA Theorem on Productive FunctionsThe complexity of Presburger arithmetic with bounded quantifier alternation depthEffective Inseparability for Sequences of SetsCreative and Weakly Creative Sequences of r.e. SetsUnnamed ItemA machine description and the hierarchy of initial Grzegorczyk classesPositive rudimentarity of the graphs of Ackermann and GrzegorczykLearning recursive functions: A surveyDevelopments from enquiries into the learnability of the pattern languages from positive dataRudimentary Languages and Second‐Order LogicAccepting/rejecting propositions from accepted/rejected propositions: A unifying overviewOn universal pairs in the Ershov hierarchyUnnamed ItemDistributional learning of parallel multiple context-free grammarsRudimentary reductions revisitedConceptual Confluence in 1936: Post and TuringFrequency computation and bounded queriesPhysical Computational Complexity and First-order LogicAn improved lower bound for the elementary theories of treesConsistent and coherent learning with \(\delta \)-delayThe concept of truth in a finite universeSemi-conservative reductionComputably enumerable sets and related issuesWCS-analysis of the context-sensitiveRecursive function theory and numerical analysisA state space approach to the finite automataLogics for reasoning about cryptographic constructionsCounting modulo finite semigroupsMit regulären Grundbegriffen definierbare PrädikateSpace-bounded reducibility among combinatorial problemsBounded monotone recursion and multihead automataThe role of rudimentary relations in complexity theoryRudimentary relations and stack languagesAre natural languages universal?Bounded minimalisation and bounded counting in argument-bounded idc'sINPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMSFeferman on ComputabilityCreativity and Effective InseparabilityInductive inference of monotonic formal systems from positive dataThe Pumping Lemma for Well-Nested Multiple Context-Free LanguagesOn Models of a Nondeterministic ComputationTime-space tradeoffs for satisfiabilitySequences Having an Effective Fixed-Point PropertyBounded arithmetic, proof complexity and two papers of ParikhON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGSExtended Canonical SystemsTheory of symbolic expressions. IClasses of Predictably Computable FunctionsAn inductive number-theoretic characterization of NPIncremental concept learning for bounded data mining.Nonerasing, counting, and majority over the linear time hierarchyThe theory of recursive functions, approaching its centennialExistential interpretation. IIEffective inseparability and its applications







This page was built for publication: Theory of Formal Systems. (AM-47)