On the expressiveness of Büchi arithmetic

DOI10.1007/978-3-030-71995-1_16OpenAlexW3109452257MaRDI QIDQ2233416FDOQ2233416

Authors: Christoph Haase, Jakub Różycki 

Publication date: 18 October 2021

Full work available at URL: https://arxiv.org/abs/2010.12892

zbMATH Keywords

automatic structureslogical theoriesregular languagesquantifier eliminationlogical definability

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites Work

• Title not available (Why is that?)
• Bounded Algol-Like Languages
• Logic and \(p\)-recognizable sets of integers
• Weak Second‐Order Arithmetic and Finite Automata
• Finite automata and unary languages
• The unreasonable ubiquitousness of quasi-polynomials
• Unary finite automata vs. arithmetic progressions
• The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable
• Definable relations and first-order query languages over strings
• Characterizing regular languages with polynomial densities
• The taming of the semi-linear set
• Title not available (Why is that?)

Cited In (3)

• On the Expressiveness of B\"uchi Arithmetic
• Title not available (Why is that?)
• On the existential arithmetics with addition and bitwise minimum

This page was built for publication: On the expressiveness of Büchi arithmetic

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