Spectra and satisfiability for logics with successor and a unary function
From MaRDI portal
Publication:5109229
DOI10.1002/malq.201500070OpenAlexW2898403117WikidataQ129080308 ScholiaQ129080308MaRDI QIDQ5109229
Publication date: 11 May 2020
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.201500070
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Logic and \(p\)-recognizable sets of integers
- The expressive power of bijections over weakly arithmetized structures
- Mathematics and Computer Science: Coping with Finiteness
- A Gentle Non-disjoint Combination of Satisfiability Procedures
- A Practical Decision Procedure for Arithmetic with Function Symbols
- A note on undecidable extensions of monadic second order successor arithmetic
- The decision problem for standard classes
- Undecidability of satisfiability of expansions of FO [ < over words with a FO [ + ]-definable set]
- Fifty years of the spectrum problem: survey and new results
- On the base-dependence of sets of numbers recognizable by finite automata
This page was built for publication: Spectra and satisfiability for logics with successor and a unary function