Relativized Adjacency

Journal of Logic, Language and Information 32 (4):707-731 (2023)
  Copy   BIBTEX

Abstract

For each class in the piecewise-local subregular hierarchy, a relativized (tier-based) variant is defined. Algebraic as well as automata-, language-, and model-theoretic characterizations are provided for each of these relativized classes, except in cases where this is provably impossible. These various characterizations are necessarily intertwined due to the well-studied logic-automaton connection and the relationship between finite-state automata and (syntactic) semigroups. Closure properties of each class are demonstrated by using automata-theoretic methods to provide constructive proofs for the closures that do hold and giving language-theoretic counterexamples for those that do not. The net result of all of this is that, rather than merely existing as an operationally-defined parallel set of classes, these relativized variants integrate cleanly with the other members of the piecewise-local subregular hierarchy from every perspective. Relativization may even prove useful in the characterization of star-free, as every star-free stringset is the preprojection of another (also star-free) stringset whose syntactic semigroup is not a monoid.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,793

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Aural Pattern Recognition Experiments and the Subregular Hierarchy.James Rogers & Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):329-342.
Language-Theoretic and Finite Relation Models for the (Full) Lambek Calculus.Christian Wurm - 2017 - Journal of Logic, Language and Information 26 (2):179-214.
Automata for Epistemic Temporal Logic with Synchronous Communication.Swarup Mohalik & R. Ramanujam - 2010 - Journal of Logic, Language and Information 19 (4):451-484.
Some Properties of Iterated Languages.Shane Steinert-Threlkeld - 2016 - Journal of Logic, Language and Information 25 (2):191-213.
Computable Heyting Algebras with Distinguished Atoms and Coatoms.Nikolay Bazhenov - 2023 - Journal of Logic, Language and Information 32 (1):3-18.
On Relation Between Linear Temporal Logic and Quantum Finite Automata.Amandeep Singh Bhatia & Ajay Kumar - 2020 - Journal of Logic, Language and Information 29 (2):109-120.
Local reflection, definable elements and 1-provability.Evgeny Kolmakov - 2020 - Archive for Mathematical Logic 59 (7-8):979-996.
Formal Notes on the Substitutional Analysis of Logical Consequence.Volker Halbach - 2020 - Notre Dame Journal of Formal Logic 61 (2):317-339.

Analytics

Added to PP
2023-05-20

Downloads
16 (#1,192,648)

6 months
6 (#812,813)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Aural Pattern Recognition Experiments and the Subregular Hierarchy.James Rogers & Geoffrey K. Pullum - 2011 - Journal of Logic, Language and Information 20 (3):329-342.
Linear Automaton Transformations.A. Nerode - 1963 - Journal of Symbolic Logic 28 (2):173-174.

Add more references