The following pages link to Theory of Formal Systems. (AM-47) (Q3276696):
Displayed 43 items.
- Extended Canonical Systems (Q3282932) (← links)
- Classes of Predictably Computable Functions (Q3293402) (← links)
- The role of rudimentary relations in complexity theory (Q3347299) (← links)
- On Models of a Nondeterministic Computation (Q3392968) (← links)
- Accepting/rejecting propositions from accepted/rejected propositions: A unifying overview (Q3537540) (← links)
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages (Q3637235) (← links)
- 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 (Q3768865) (← links)
- The theory of recursive functions, approaching its centennial (Q3946156) (← links)
- Existential interpretation. II (Q3955341) (← links)
- Sequences Having an Effective Fixed-Point Property (Q4081222) (← links)
- Semi-conservative reduction (Q4120563) (← links)
- Rudimentary relations and stack languages (Q4147594) (← links)
- INPUT/OUTPUT CODINGS AND TRANSITION FUNCTIONS IN EFFECTIVE SYSTEMS (Q4162665) (← links)
- (Q4222859) (← links)
- Isomorphism of lattices of recursively enumerable sets (Q4337954) (← links)
- Rudimentary Languages and Second‐Order Logic (Q4351932) (← links)
- <i>A Beginner's Guide to Mathematical Logic</i> (Q4577003) (← links)
- The Gödelian Foundations of Self-Reference,the Liar and Incompleteness: Arms Racein Complex Strategic Innovation (Q4606776) (← links)
- Conceptual Confluence in 1936: Post and Turing (Q4637215) (← links)
- An improved lower bound for the elementary theories of trees (Q4647523) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- HOW MUCH PROPOSITIONAL LOGIC SUFFICES FOR ROSSER’S ESSENTIAL UNDECIDABILITY THEOREM? (Q5078818) (← links)
- Physical Computational Complexity and First-order Logic (Q5158662) (← links)
- Feferman on Computability (Q5214780) (← links)
- Report on attainability of systems of identities (Q5340944) (← links)
- On the Degrees of Index Sets (Q5519130) (← links)
- Isomorphism Types of Index Sets of Partial Recursive Functions (Q5547579) (← links)
- On Creative Sets and Indices of Partial Recursive Functions (Q5547580) (← links)
- (Q5552746) (← links)
- Deduction-preserving “recursive isomorphisms” between theories (Q5561955) (← links)
- Context-free languages and rudimentary attributes (Q5569455) (← links)
- Effectively Simple Sets (Q5586285) (← links)
- On some metamathematical results as properties of general systems (Q5595151) (← links)
- A Theorem on Productive Functions (Q5601466) (← links)
- Effective Inseparability for Sequences of Sets (Q5602101) (← links)
- Creative and Weakly Creative Sequences of r.e. Sets (Q5602102) (← links)
- “Recursive isomorphism” and effectively extensible theories (Q5608005) (← links)
- Subrecursiveness: Machine-independent notions of computability in restricted time and storage (Q5637881) (← links)
- Creativity and Effective Inseparability (Q5727660) (← links)
- The concept of truth in a finite universe (Q5928928) (← links)
- Counting modulo finite semigroups (Q5941256) (← links)
- On approximately identifying concept classes in the limit (Q6061901) (← links)
- A step towards absolute versions of metamathematical results (Q6150669) (← links)