Pages that link to "Item:Q1217684"
From MaRDI portal
The following pages link to Elementary induction on abstract structures (Q1217684):
Displayed 50 items.
- Robinson forcing is not absolute (Q1245825) (← links)
- Inductive definitions, models of comprehension and invariant definability (Q1247418) (← links)
- A restricted second order logic for finite structures (Q1271559) (← links)
- The expressive power of circumscription (Q1274695) (← links)
- The modal mu-calculus alternation hierarchy is strict (Q1276239) (← links)
- Reasoning about nondeterministic and concurrent actions: A process algebra approach (Q1277769) (← links)
- From axiomatics to intrinsic characterization: some open problems in computable analysis (Q1292411) (← links)
- Some results on cut-elimination, provable well-orderings, induction and reflection (Q1295413) (← links)
- Game-theoretic inductive definability (Q1314543) (← links)
- IMPS: An interactive mathematical proof system (Q1319391) (← links)
- Querying datalog programs with temporal logic (Q1323325) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- How to define a linear order on finite models (Q1371431) (← links)
- A query language for NC (Q1376409) (← links)
- Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\) (Q1399101) (← links)
- On the costs of nonclassical logic (Q1749804) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- Bounds in the propagation of selection into logic programs (Q1813949) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- What is so special with the powerset operation? (Q1882625) (← links)
- Expressive equivalence of least and inflationary fixed-point logic (Q1886320) (← links)
- First-order theories for pure Prolog programs with negation (Q1892097) (← links)
- Generalized quantifiers and pebble games on finite structures (Q1892941) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- A Buchholz rule for modal fixed point logics (Q1942334) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Grounding, quantifiers, and paradoxes (Q2056222) (← links)
- Infinitary action logic with exponentiation (Q2067638) (← links)
- Non-reflexivity and revenge (Q2078982) (← links)
- Predicativity and constructive mathematics (Q2080590) (← links)
- Stage comparison, fixed points, and least fixed points in Kripke-Platek environments (Q2108575) (← links)
- Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts (Q2144614) (← links)
- A unified approach to semantic and soritical paradoxes (Q2148812) (← links)
- Inner constructivizability of functional structures (Q2165606) (← links)
- Non-terminating processes in the situation calculus (Q2188782) (← links)
- A characterization of \(\Sigma_1^1\)-reflecting ordinals (Q2231693) (← links)
- Short note: least fixed points versus least closed points (Q2238139) (← links)
- Full and hat inductive definitions are equivalent in NBG (Q2257106) (← links)
- Proof theory and ordinal analysis (Q2276954) (← links)
- Elementary inductive dichotomy: separation of open and clopen determinacies with infinite alternatives (Q2285848) (← links)
- The envelope of a pointclass under a local determinacy hypothesis (Q2352255) (← links)
- Truth, dependence and supervaluation: living with the ghost (Q2377186) (← links)
- Adding a conditional to Kripke's theory of truth (Q2397814) (← links)
- Generalized hyperarithmetical computability over structures (Q2401541) (← links)
- Revision without revision sequences: circular definitions (Q2420713) (← links)
- Rethinking revision (Q2420716) (← links)
- Bounding lemmata for non-deterministic halting times of transfinite Turing machines (Q2482464) (← links)
- Forcing and antifoundation (Q2486987) (← links)
- Comparison of expressive power of some query languages for databases (Q2510772) (← links)