The following pages link to Theory of Formal Systems. (AM-47) (Q3276696):
Displayed 50 items.
- The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics (Q383070) (← links)
- Distributional learning of parallel multiple context-free grammars (Q479454) (← links)
- Frequency computation and bounded queries (Q671360) (← links)
- Computably enumerable sets and related issues (Q695800) (← links)
- Inductive inference of monotonic formal systems from positive data (Q749217) (← links)
- Theory of symbolic expressions. I (Q791311) (← links)
- From learning in the limit to stochastic finite learning (Q860825) (← links)
- Learning a subclass of regular patterns in polynomial time (Q860829) (← links)
- A note on A.E. h-complex functions (Q909459) (← links)
- Learning recursive functions: A survey (Q924164) (← links)
- Developments from enquiries into the learnability of the pattern languages from positive data (Q924175) (← links)
- Consistent and coherent learning with \(\delta \)-delay (Q958312) (← links)
- An inductive number-theoretic characterization of NP (Q1057649) (← links)
- Uniform self-reference (Q1088657) (← links)
- Maximal theories (Q1093629) (← links)
- Unsolvable algorithmic problems for semigroups, groups and rings (Q1117039) (← links)
- Rudimentary relations and primitive recursion: A toolbox (Q1127532) (← links)
- What does logic have to tell us about mathematical proofs? (Q1135835) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- The independence of control structures in abstract programming systems (Q1155949) (← links)
- On the relation provable equivalence and on partitions in effectively inseparable sets (Q1156125) (← links)
- The complexity of Presburger arithmetic with bounded quantifier alternation depth (Q1163534) (← links)
- A machine description and the hierarchy of initial Grzegorczyk classes (Q1168308) (← links)
- Positive rudimentarity of the graphs of Ackermann and Grzegorczyk (Q1168313) (← links)
- Rudimentary reductions revisited (Q1183444) (← links)
- WCS-analysis of the context-sensitive (Q1214919) (← links)
- Recursive function theory and numerical analysis (Q1216028) (← links)
- Mit regulären Grundbegriffen definierbare Prädikate (Q1219876) (← links)
- Space-bounded reducibility among combinatorial problems (Q1221749) (← links)
- Are natural languages universal? (Q1231476) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- On recursive bounds for the exceptional values in speed-up (Q1334675) (← links)
- Elementary realizability (Q1362589) (← links)
- A descriptive complexity approach to the linear hierarchy. (Q1401413) (← links)
- Time-space tradeoffs for satisfiability (Q1567402) (← links)
- The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors (Q1635507) (← links)
- Automatic synthesis of logical models for order-sorted first-order theories (Q1655487) (← links)
- Incremental concept learning for bounded data mining. (Q1854293) (← links)
- Nonerasing, counting, and majority over the linear time hierarchy (Q1854524) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Elementary functions and loop programs (Q1903128) (← links)
- Transfinite induction within Peano arithmetic (Q1919522) (← links)
- The expressiveness of locally stratified programs (Q1924734) (← links)
- Bounded monotone recursion and multihead automata (Q2017762) (← links)
- Effective inseparability and its applications (Q2117804) (← links)
- On universal pairs in the Ershov hierarchy (Q2221958) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb (Q2663342) (← links)
- A Survey on Universal Computably Enumerable Equivalence Relations (Q2970971) (← links)