Monadic Elementary Formal Systems
From MaRDI portal
Publication:5622168
DOI10.1002/malq.19610070602zbMath0218.02030OpenAlexW2088685990MaRDI QIDQ5622168
Publication date: 1961
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19610070602
Related Items (30)
Hypothesis finding based on upward refinement of residue hypotheses. ⋮ Learning elementary formal systems with queries. ⋮ Advanced elementary formal systems. ⋮ Refutable language learning with a neighbor system. ⋮ The origins of structural operational semantics ⋮ Generating languages by a derivation procedure for elementary formal systems ⋮ Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ Super-exponentials nonprimitive recursive, but rudimentary ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Some general incompleteness results for partial correctness logics ⋮ On parallel hierarchies and \(R_k^i\) ⋮ Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic ⋮ Deterministic summation modulo \(\mathcal B_{n}\), the semigroup of binary relations on \(0,1, \dots, n-1\) ⋮ Twenty years of rewriting logic ⋮ A Characterisation of the Relations Definable in Presburger Arithmetic ⋮ Learning elementary formal systems ⋮ Towards a mathematical theory of machine discovery from facts ⋮ How complicated is the set of stable models of a recursive logic program? ⋮ Functional interpretations of feasibly constructive arithmetic ⋮ Injecting inconsistencies into models of PA ⋮ On the power of inductive inference from good examples ⋮ Multiple splicing systems and the universal computability ⋮ Logical string rewriting ⋮ Synthesizing learners tolerating computable noisy data ⋮ Inductive inference of unbounded unions of pattern languages from positive data ⋮ R.e. Prime powers and total rigidity ⋮ Closedness properties in ex-identification ⋮ The Generalized Nagell–Ljunggren Problem: Powers with Repetitive Representations ⋮ On the power of probabilistic strategies in inductive inference ⋮ Mind change complexity of learning logic programs
This page was built for publication: Monadic Elementary Formal Systems
