Bounded degree and planar spectra

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting models to be either planar (in the graph-theoretic sense) or by...

Full description

Bibliographic Details
Published in:	Logical Methods in Computer Science
Main Authors:	Anuj Dawar, Eryk Kopczyński
Format:	Article
Language:	English
Published:	Logical Methods in Computer Science e.V. 2017-11-01
Subjects:	computer science - logic in computer science mathematics - logic 03c13, 68q19 f.4.1 f.1.3
Online Access:	https://lmcs.episciences.org/2024/pdf

Similar Items

Logical properties of random graphs from small addable classes
by: Anuj Dawar, et al.
Published: (2019-07-01)

A note on first-order spectra with binary relations
by: Eryk Kopczynski, et al.
Published: (2018-04-01)

First-order query evaluation on structures of bounded degree
by: Wojciech Kazana, et al.
Published: (2011-06-01)

On the relative asymptotic expressivity of inference frameworks
by: Vera Koponen, et al.
Published: (2024-11-01)

Unprovability of circuit upper bounds in Cook's theory PV
by: Jan Krajicek, et al.
Published: (2017-02-01)

Derivation Lengths Classification of G\"odel's T Extending Howard's Assignment
by: Gunnar Wilken, et al.
Published: (2012-03-01)

Unification and Logarithmic Space
by: Clément Aubert, et al.
Published: (2018-07-01)

A limitation on the KPT interpolation
by: Jan Krajíček
Published: (2020-08-01)

Linear Datalog and Bounded Path Duality of Relational Structures
by: Victor Dalmau
Published: (2005-04-01)

Non-Obfuscated Unprovable Programs & Many Resultant Subtleties
by: John Case, et al.
Published: (2016-04-01)

Guarded and Unguarded Iteration for Generalized Processes
by: Sergey Goncharov, et al.
Published: (2019-07-01)

Successor-Invariant First-Order Logic on Classes of Bounded Degree
by: Julien Grange
Published: (2021-08-01)

An extensible equality checking algorithm for dependent type theories
by: Andrej Bauer, et al.
Published: (2022-01-01)

Canonical Models and the Complexity of Modal Team Logic
by: Martin Lück
Published: (2019-04-01)

The Complexity of Infinite Computations In Models of Set Theory
by: Olivier Finkel
Published: (2009-12-01)

Relational Models for the Lambek Calculus with Intersection and Constants
by: Stepan L. Kuznetsov
Published: (2023-12-01)

A program for the full axiom of choice
by: Jean-Louis Krivine
Published: (2021-09-01)

On the Succinctness of Atoms of Dependency
by: Martin Lück, et al.
Published: (2019-08-01)

Model-Checking Problems as a Basis for Parameterized Intractability
by: Joerg Flum, et al.
Published: (2005-03-01)

On tractability and congruence distributivity
by: Emil Kiss, et al.
Published: (2007-06-01)

On completeness and parametricity in the realizability semantics of System F
by: Paolo Pistone
Published: (2019-10-01)

Build your own clarithmetic I: Setup and completeness
by: Giorgi Japaridze
Published: (2017-04-01)

Build your own clarithmetic II: Soundness
by: Giorgi Japaridze
Published: (2017-04-01)

Bounded Linear Logic, Revisited
by: Ugo Dal Lago, et al.
Published: (2010-12-01)

The Wadge Hierarchy of Deterministic Tree Languages
by: Filip Murlak
Published: (2008-12-01)

Real Analytic Machines and Degrees
by: Tobias Gärtner, et al.
Published: (2011-09-01)

Finitary Simulation of Infinitary $\beta$-Reduction via Taylor Expansion, and Applications
by: Rémy Cerda, et al.
Published: (2023-12-01)

On the locality of arb-invariant first-order formulas with modulo counting quantifiers
by: Frederik Harwath, et al.
Published: (2017-04-01)

A syntactic approach to continuity of T-definable functionals
by: Chuangjie Xu
Published: (2020-02-01)

Realizability algebras II : new models of ZF + DC
by: Jean-Louis Krivine
Published: (2012-02-01)

Normalisation Control in Deep Inference via Atomic Flows
by: Alessio Guglielmi, et al.
Published: (2008-03-01)

Finitely generated free Heyting algebras via Birkhoff duality and coalgebra
by: Nick Bezhanishvili, et al.
Published: (2011-05-01)

Algorithmic Randomness and Capacity of Closed Sets
by: Douglas Cenzer, et al.
Published: (2011-09-01)

Kripke Semantics for Martin-L\"of's Extensional Type Theory
by: Steve Awodey, et al.
Published: (2011-09-01)

Internalising modified realisability in constructive type theory
by: Erik Palmgren
Published: (2005-10-01)

Focusing in Orthologic
by: Olivier Laurent
Published: (2017-07-01)

Validity and Entailment in Modal and Propositional Dependence Logics
by: Miika Hannula
Published: (2019-04-01)

The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function
by: Vassilios Gregoriades
Published: (2011-11-01)

On properties of $B$-terms
by: Mirai Ikebuchi, et al.
Published: (2020-06-01)

Closed Sets and Operators thereon: Representations, Computability and Complexity
by: Carsten Rösnick-Neugebauer
Published: (2018-04-01)