μ-definable sets of integers
From MaRDI portal
Publication:5287693
DOI10.2307/2275338zbMATH Open0776.03022OpenAlexW2090634299MaRDI QIDQ5287693FDOQ5287693
Authors: Robert S. Lubarsky 
Publication date: 17 August 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275338
Recommendations
first-order logicfixed pointsadmissibilityinductive definitions\(\mu\)-calculusprenex normal formreflection properties
Cites Work
Cited In (18)
- An intensional fixed point theory over first order arithmetic
- On the universal and existential fragments of the \(\mu\)-calculus
- Extending constructive operational set theory by impredicative principles
- Title not available (Why is that?)
- A fixed point theory over stratified truth
- 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03
- Fixpoint alternation: arithmetic, transition systems, and the binary tree
- The modal mu-calculus alternation hierarchy is strict
- On fixpoint arithmetic and infinite time Turing machines
- Title not available (Why is that?)
- Domain mu-calculus
- On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
- A Buchholz rule for modal fixed point logics
- Parallel feedback Turing computability
- The modal mu-calculus alternation hierarchy is strict
- Temporal verification of programs via first-order fixpoint logic
- Fold/unfold transformations for fixpoint logic
- Fixpoints, games and the difference hierarchy
This page was built for publication: μ-definable sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287693)
