On nonmonotone inductive definability

DOI10.4064/FM-82-1-39-83MaRDI QIDQ4063427zbMATH OpenOpenAlexFDO

Authors Yiannis N. Moschovakis

Publication date 1974

Published in Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/214679

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55) Descriptive set theory (03E15) Large cardinals (03E55)

Cited in

(12)

• Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions
• Inductive definitions, models of comprehension and invariant definability
• The computational complexity of asymptotic problems. I: Partial orders
• Fixed-point extensions of first-order logic
• The Theory of Countable Analytical Sets
• The undecidability of iterated modal relativization
• ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS
• On monotone vs. nonmonotone induction
• Expressive equivalence of least and inflationary fixed-point logic
• The automorphism tower of a centerless group without choice
• On the Performance of Axiom Systems
• A proof of Grilliot's theorem

This page was built for publication: On nonmonotone inductive definability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4063427)