μ-definable sets of integers
From MaRDI portal
Publication:5287693
DOI10.2307/2275338zbMath0776.03022OpenAlexW2090634299MaRDI QIDQ5287693
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
fixed points\(\mu\)-calculusfirst-order logicadmissibilityinductive definitionsprenex normal formreflection properties
Related Items (14)
An intensional fixed point theory over first order arithmetic ⋮ Parallel Feedback Turing Computability ⋮ On the universal and existential fragments of the \(\mu\)-calculus ⋮ On fixpoint arithmetic and infinite time Turing machines ⋮ A fixed point theory over stratified truth ⋮ Extending constructive operational set theory by impredicative principles ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Fold/Unfold Transformations for Fixpoint Logic ⋮ 2003 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquim '03 ⋮ Fixpoint alternation: arithmetic, transition systems, and the binary tree ⋮ Domain mu-calculus ⋮ Fixpoints, games and the difference hierarchy ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ On the Strength of the Uniform Fixed Point Principle in Intuitionistic Explicit Mathematics
Cites Work
This page was built for publication: μ-definable sets of integers
