Representing hyper-arithmetical sets by equations over sets of integers
From MaRDI portal
Publication:693054
DOI10.1007/S00224-011-9352-5zbMATH Open1279.68158OpenAlexW3101545656MaRDI QIDQ693054FDOQ693054
Authors: Artur Jeż, Alexander Okhotin 
Publication date: 7 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9352-5
Recommendations
- On equations over sets of integers
- Equations over sets of integers with addition only
- Least and greatest solutions of equations over sets of integers
- Least and greatest solutions of equations over sets of integers
- Equations \(X + A = B\) and \((X + X) + C = (X - X) + D\) over sets of natural numbers
Cites Work
- Elementary induction on abstract structures
- Title not available (Why is that?)
- The power of commuting with finite sets of words
- Presburger arithmetic with unary predicates is Π11 complete
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth
- The complexity of membership problems for circuits over sets of natural numbers
- On equations over sets of numbers and their limitations
- CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES
- Title not available (Why is that?)
- Two Families of Languages Related to ALGOL
- Complexity of equations over sets of natural numbers
- Unresolved systems of language equations: expressive power and decision problems
- The complexity of membership problems for circuits over sets of integers
- Decision problems for language equations
- On the Computational Completeness of Equations over Sets of Natural Numbers
- On language equations \(XXK = XXL\) and \(XM = N\) over a unary alphabet
- On the expressive power of univariate equations over sets of natural numbers
- Equations over sets of natural numbers with addition only
- One-nonterminal conjunctive grammars over a unary alphabet
- The finite power property in free groups
- Computational universality in one-variable language equations
- Least and greatest solutions of equations over sets of integers
- An introduction to hyperarithmetical functions
Cited In (12)
- Least and greatest solutions of equations over sets of integers
- Hyperarithmetical Sets
- Equations \(X + A = B\) and \((X + X) + C = (X - X) + D\) over sets of natural numbers
- Equations over sets of integers with addition only
- Conjunctive and Boolean grammars: the true general case of the context-free grammars
- On equations over sets of integers
- Language equations
- Computable fixpoints in well-structured symbolic model checking
- Computational completeness of equations over sets of natural numbers
- A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets
- Arithmetic sets in groups
- Least and greatest solutions of equations over sets of integers
Uses Software
This page was built for publication: Representing hyper-arithmetical sets by equations over sets of integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693054)
