:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Benedikt, Michael, Pradic, Cécilia, Wernhard, Christoph
Format:	Preprint
Published:	2022
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2212.03085
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The equational theory of the Weihrauch lattice with (iterated) composition
by: Pradic, Cécilia
Published: (2024)

Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
by: Heuer, Jan, et al.
Published: (2024)

The equational theory of the Weihrauch lattice with multiplication
by: Neumann, Eike, et al.
Published: (2024)

The Myhill isomorphism theorem does not generalize much
by: Pradic, Cécilia
Published: (2025)

Generating Theorems by Generating Proof Structures
by: Wernhard, Christoph
Published: (2026)

Craig-Lyndon Interpolation for the Logic of Here and There with a Variation of Mints' Sequent System
by: Wernhard, Christoph
Published: (2026)

Interpolation with Automated First-Order Reasoning
by: Wernhard, Christoph
Published: (2025)

The Boolean Solution Problem from the Perspective of Predicate Logic -- Extended Version
by: Wernhard, Christoph
Published: (2017)

Mathematical Knowledge Bases as Grammar-Compressed Proof Terms: Exploring Metamath Proof Structures
by: Wernhard, Christoph, et al.
Published: (2025)

A proof theory of (omega-)context-free languages, via non-wellfounded proofs
by: Das, Anupam, et al.
Published: (2024)

Investigations into Proof Structures
by: Wernhard, Christoph, et al.
Published: (2023)

A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)

Weihrauch problems as containers
by: Pradic, Cécilia, et al.
Published: (2025)

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

Lemmas: Generation, Selection, Application
by: Rawson, Michael, et al.
Published: (2023)

Problems with fixpoints of polynomials of polynomials
by: Pradic, Cécilia, et al.
Published: (2026)

Wider systems for linear logic with fixed points: proof theory and complexity
by: Das, Anupam, et al.
Published: (2026)

Interpolation in Classical Propositional Logic
by: Koopmann, Patrick, et al.
Published: (2025)

Cyclic proof theory of positive inductive definitions
by: Curzi, Gianluca, et al.
Published: (2025)

Recursive querying of neural networks via weighted structures
by: Grohe, Martin, et al.
Published: (2026)

Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
by: Di Guardia, Rémi, et al.
Published: (2026)

Sharing proofs with predicative theories through universe-polymorphic elaboration
by: Felicissimo, Thiago, et al.
Published: (2023)

Computably discrete represented spaces
by: Neumann, Eike, et al.
Published: (2025)

Extracting efficient exact real number computation from proofs in constructive type theory
by: Konečný, Michal, et al.
Published: (2022)

A logic of judgmental existence and its relation to proof irrelevance
by: Pezlar, Ivo
Published: (2024)

Yet another cubical type theory, but via a semantic approach
by: Kapulkin, Chris, et al.
Published: (2025)

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

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

Implicit automata in λ-calculi III: affine planar string-to-string functions
by: Pradic, Cécilia, et al.
Published: (2024)

Dyadic obligations: proofs and countermodels via hypersequents
by: Ciabattoni, Agata, et al.
Published: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

List types for resource aware languages: an implicit name approach
by: Ghilezan, Silvia, et al.
Published: (2021)

Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)

Undecidability of theories of semirings with fixed points
by: Das, Anupam, et al.
Published: (2025)

OSVAuto: automatic proofs about functional specifications in OS verification
by: Wu, Yulun, et al.
Published: (2024)

The Leibniz adjunction in homotopy type theory, with an application to simplicial type theory
by: de Jong, Tom, et al.
Published: (2026)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

On proving consistency of equational theories in Bounded Arithmetic
by: Beckmann, Arnold, et al.
Published: (2022)

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)