:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Pago, Benedikt
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2401.07147
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Lower Bounds for Symmetric Modular Circuits
by: Pago, Benedikt
Published: (2026)

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
by: Dwivedi, Prateek, et al.
Published: (2026)

Arity hierarchies for quantifiers closed under partial polymorphisms
by: Dawar, Anuj, et al.
Published: (2025)

Preservation Theorems in Semiring Semantics
by: Brinke, Sophie, et al.
Published: (2026)

Symmetric Proofs in the Ideal Proof System
by: Dawar, Anuj, et al.
Published: (2025)

Choiceless Polynomial Space
by: Ferrarotti, Flavio, et al.
Published: (2024)

Embedded Finite Models Beyond Restricted Quantifier Collapse
by: Benedikt, Michael, et al.
Published: (2023)

How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
by: Benedikt, Michael, et al.
Published: (2026)

From learnable objects to learnable random objects
by: Anderson, Aaron, et al.
Published: (2025)

Defining implication relation for classical logic
by: Fu, Li
Published: (2013)

Definability and Interpolation in Philosophy
by: van Benthem, Johan
Published: (2026)

Limits with Signed Digit Streams
by: Wiesnet, Franziskus
Published: (2018)

Limited Math: Aligning Mathematical Semantics with Finite Computation
by: Wen, Lian
Published: (2026)

Semantic Properties of Computations Defined by Elementary Inference Systems
by: Lucas, Salvador
Published: (2025)

Full Definability in a Profunctorial Model
by: Tsukada, Takeshi, et al.
Published: (2026)

Tighter Bounds for Query Answering with Guarded TGDs
by: Amarilli, Antoine, et al.
Published: (2022)

Parameterized Infinite-State Reactive Synthesis
by: Maderbacher, Benedikt, et al.
Published: (2025)

Probabilistic Strategies: Definability and the Tensor Completeness Problem
by: Bowler, Nathan, et al.
Published: (2025)

Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents
by: Lyon, Tim S., et al.
Published: (2024)

The Complexity of Defining and Separating Fixpoint Formulae in Modal Logic
by: Jung, Jean Christoph, et al.
Published: (2025)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

Breaking Symmetries with Involutions
by: Codish, Michael, et al.
Published: (2025)

Dynamic Probability Logic: Decidability & Computability
by: Chopoghloo, Somayeh, et al.
Published: (2024)

Fixed Point Theorems in Computability Theory
by: Terwijn, Sebastiaan A.
Published: (2024)

Synthesizing nested relational queries from implicit specifications: via model theory and via proof theory
by: Benedikt, Michael, et al.
Published: (2022)

The complexity of Presburger arithmetic with power or powers
by: Benedikt, Michael, et al.
Published: (2023)

On the Satisfiability of Local First-Order Logics with Data
by: Bollig, Benedikt, et al.
Published: (2023)

Branch-Well-Structured Transition Systems and Extensions
by: Bollig, Benedikt, et al.
Published: (2022)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

Non-strongly Stable Orders Also Define Interesting Simulation Relations
by: Fábregas, Ignacio, et al.
Published: (2024)

On the Number of Quantifiers Needed to Define Boolean Functions
by: Carmosino, Marco, et al.
Published: (2024)

Decidability of Graph Neural Networks via Logical Characterizations
by: Benedikt, Michael, et al.
Published: (2024)

Analysis of logics with arithmetic
by: Benedikt, Michael, et al.
Published: (2025)

Meta-Mathematics of Computational Complexity Theory
by: Oliveira, Igor C.
Published: (2025)

Construction Defining Functionality:A Constructive Perspective on Functions through Their Generated Structures
by: Nishiyama, Yumiko
Published: (2025)

Symmetries of Dependency Quantified Boolean Formulas
by: Hofstadler, Clemens, et al.
Published: (2024)

Complete Symmetry Breaking for Finite Models
by: Dančo, Marek, et al.
Published: (2025)

Learning Aggregate Queries Defined by First-Order Logic with Counting
by: van Bergerem, Steffen, et al.
Published: (2024)

An Introduction to Different Approaches to Initial Semantics
by: Lamiaux, Thomas, et al.
Published: (2024)

Breaking Symmetries from a Set-Covering Perspective
by: Codish, Michael, et al.
Published: (2025)