Imagen de Portada

On first-order model checking parameterized by the number of variables

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Jedelský, Jan
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Transductions of Graph Classes Admitting Product Structure
por: Hliněný, Petr, et al.
Publicado: (2025)

Elementary first-order model checking for sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2024)

k-Planar and Fan-Crossing Drawings and Transductions of Embeddable Graphs
por: Hliněný, Petr, et al.
Publicado: (2025)

Towards the verification of a generic interlocking logic: Dafny meets parameterized model checking
por: Cimatti, Alessandro, et al.
Publicado: (2024)

First-order transducibility among classes of sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2025)

On semantics of first-order justification logic with binding modalities
por: Yavorskaya, Tatiana, et al.
Publicado: (2025)

Formula size game and model checking for modal substitution calculus
por: Ahvonen, Veeti, et al.
Publicado: (2025)

On the expressive power of inquisitive team logic and inquisitive first-order logic
por: Kontinen, Juha, et al.
Publicado: (2026)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
por: Oda, Yukihiro, et al.
Publicado: (2021)

Making first order linear logic a generating grammar
por: Slavnov, Sergey
Publicado: (2022)

On first-order transductions of classes of graphs
por: Braunfeld, Samuel, et al.
Publicado: (2022)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
por: Gaßner, Christine
Publicado: (2025)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
por: Powell, Thomas
Publicado: (2023)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
por: Gaßner, Christine
Publicado: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
por: Gaßner, Christine
Publicado: (2025)

On first-order definable operations on relational structures
por: Courcelle, Bruno
Publicado: (2026)

A very sharp threshold for first order logic distinguishability of random graphs
por: Benjamini, Itai, et al.
Publicado: (2022)

Synthesis for prefix first-order logic on data words
por: Grange, Julien, et al.
Publicado: (2024)

Forcing and Interpolation in first-order hybrid Logic with rigid symbols
por: Găină, Daniel, et al.
Publicado: (2026)

Parameterized Model-checking of Discrete-Timed Networks and Symmetric-Broadcast Systems
por: Aminof, Benjamin, et al.
Publicado: (2023)

Model-checking positive equality free logic on a fixed structure (direttissima)
por: Bodirsky, Manuel, et al.
Publicado: (2024)

Order-invariant cluster first-order logic on graph classes of bounded degree
por: Ghasemi, Fatemeh, et al.
Publicado: (2026)

Bijective proofs for Eulerian numbers of types B and D
por: Santocanale, Luigi
Publicado: (2021)

Boolean basis, formula size, and number of modal operators
por: Berkholz, Christoph, et al.
Publicado: (2024)

Complete first-order reasoning for functional programs
por: Murali, Adithya, et al.
Publicado: (2026)

Proof-theoretic Semantics for Second-order Logic
por: Gheorghiu, Alexander V., et al.
Publicado: (2025)

Countability constraints in order-theoretic approaches to computability
por: Hack, Pedro, et al.
Publicado: (2022)

Proof-theoretic Semantics for First-order Logic
por: Gheorghiu, Alexander V.
Publicado: (2024)

Model checking with temporal graphs and their derivative
por: Bui-Xuan, Binh-Minh, et al.
Publicado: (2026)

The proof theory and semantics of second-order (intuitionistic) tense logic
por: Becker, Justus, et al.
Publicado: (2026)

First-order Logic with Being a Thesis Modal Operator
por: Łyczak, Marcin
Publicado: (2024)

A linear proof language for second-order intuitionistic linear logic
por: Díaz-Caro, Alejandro, et al.
Publicado: (2023)

Decomposing graphs into stable and ordered parts
por: Buffière, Hector, et al.
Publicado: (2025)

A shallow dive into the depths of non-termination checking for C programs
por: Metta, Ravindra, et al.
Publicado: (2024)

A first-order logic characterization of safety and co-safety languages
por: Cimatti, Alessandro, et al.
Publicado: (2022)

Constant time testability of first-order logic with modulo counting on finitary graphs
por: Adler, Isolde, et al.
Publicado: (2026)

Semantics out of context: nominal absolute denotations for first-order logic and computation
por: Gabbay, Murdoch J.
Publicado: (2013)

Higher-order Kripke models for intuitionistic and non-classical modal logics
por: Barroso-Nascimento, Victor
Publicado: (2025)

An order out of nowhere: a new algorithm for infinite-domain CSPs
por: Mottet, Antoine, et al.
Publicado: (2023)

Completeness of Relational Algebra via Cylindric Algebra
por: Laštovička, Jan
Publicado: (2026)