Guardado en:
| Autores principales: | Benedikt, Michael, Pradic, Cécilia, Wernhard, Christoph |
|---|---|
| Formato: | Preprint |
| Publicado: |
2022
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2212.03085 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
The equational theory of the Weihrauch lattice with (iterated) composition
por: Pradic, Cécilia
Publicado: (2024)
por: Pradic, Cécilia
Publicado: (2024)
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
por: Heuer, Jan, et al.
Publicado: (2024)
por: Heuer, Jan, et al.
Publicado: (2024)
The equational theory of the Weihrauch lattice with multiplication
por: Neumann, Eike, et al.
Publicado: (2024)
por: Neumann, Eike, et al.
Publicado: (2024)
The Myhill isomorphism theorem does not generalize much
por: Pradic, Cécilia
Publicado: (2025)
por: Pradic, Cécilia
Publicado: (2025)
Generating Theorems by Generating Proof Structures
por: Wernhard, Christoph
Publicado: (2026)
por: Wernhard, Christoph
Publicado: (2026)
Craig-Lyndon Interpolation for the Logic of Here and There with a Variation of Mints' Sequent System
por: Wernhard, Christoph
Publicado: (2026)
por: Wernhard, Christoph
Publicado: (2026)
Interpolation with Automated First-Order Reasoning
por: Wernhard, Christoph
Publicado: (2025)
por: Wernhard, Christoph
Publicado: (2025)
The Boolean Solution Problem from the Perspective of Predicate Logic -- Extended Version
por: Wernhard, Christoph
Publicado: (2017)
por: Wernhard, Christoph
Publicado: (2017)
Mathematical Knowledge Bases as Grammar-Compressed Proof Terms: Exploring Metamath Proof Structures
por: Wernhard, Christoph, et al.
Publicado: (2025)
por: Wernhard, Christoph, et al.
Publicado: (2025)
A proof theory of (omega-)context-free languages, via non-wellfounded proofs
por: Das, Anupam, et al.
Publicado: (2024)
por: Das, Anupam, et al.
Publicado: (2024)
Investigations into Proof Structures
por: Wernhard, Christoph, et al.
Publicado: (2023)
por: Wernhard, Christoph, et al.
Publicado: (2023)
A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)
por: Das, Anupam, et al.
Publicado: (2024)
Weihrauch problems as containers
por: Pradic, Cécilia, et al.
Publicado: (2025)
por: Pradic, Cécilia, et al.
Publicado: (2025)
The proof theory and semantics of second-order (intuitionistic) tense logic
por: Becker, Justus, et al.
Publicado: (2026)
por: Becker, Justus, et al.
Publicado: (2026)
Lemmas: Generation, Selection, Application
por: Rawson, Michael, et al.
Publicado: (2023)
por: Rawson, Michael, et al.
Publicado: (2023)
Problems with fixpoints of polynomials of polynomials
por: Pradic, Cécilia, et al.
Publicado: (2026)
por: Pradic, Cécilia, et al.
Publicado: (2026)
Wider systems for linear logic with fixed points: proof theory and complexity
por: Das, Anupam, et al.
Publicado: (2026)
por: Das, Anupam, et al.
Publicado: (2026)
Interpolation in Classical Propositional Logic
por: Koopmann, Patrick, et al.
Publicado: (2025)
por: Koopmann, Patrick, et al.
Publicado: (2025)
Cyclic proof theory of positive inductive definitions
por: Curzi, Gianluca, et al.
Publicado: (2025)
por: Curzi, Gianluca, et al.
Publicado: (2025)
Recursive querying of neural networks via weighted structures
por: Grohe, Martin, et al.
Publicado: (2026)
por: Grohe, Martin, et al.
Publicado: (2026)
Bayesian Networks and Proof-Nets: the proof-theory of Bayesian Inference
por: Di Guardia, Rémi, et al.
Publicado: (2026)
por: Di Guardia, Rémi, et al.
Publicado: (2026)
Sharing proofs with predicative theories through universe-polymorphic elaboration
por: Felicissimo, Thiago, et al.
Publicado: (2023)
por: Felicissimo, Thiago, et al.
Publicado: (2023)
Computably discrete represented spaces
por: Neumann, Eike, et al.
Publicado: (2025)
por: Neumann, Eike, et al.
Publicado: (2025)
Extracting efficient exact real number computation from proofs in constructive type theory
por: Konečný, Michal, et al.
Publicado: (2022)
por: Konečný, Michal, et al.
Publicado: (2022)
A logic of judgmental existence and its relation to proof irrelevance
por: Pezlar, Ivo
Publicado: (2024)
por: Pezlar, Ivo
Publicado: (2024)
Yet another cubical type theory, but via a semantic approach
por: Kapulkin, Chris, et al.
Publicado: (2025)
por: Kapulkin, Chris, et al.
Publicado: (2025)
Embedded Finite Models Beyond Restricted Quantifier Collapse
por: Benedikt, Michael, et al.
Publicado: (2023)
por: Benedikt, Michael, et al.
Publicado: (2023)
Decidability of Graph Neural Networks via Logical Characterizations
por: Benedikt, Michael, et al.
Publicado: (2024)
por: Benedikt, Michael, et al.
Publicado: (2024)
Implicit automata in λ-calculi III: affine planar string-to-string functions
por: Pradic, Cécilia, et al.
Publicado: (2024)
por: Pradic, Cécilia, et al.
Publicado: (2024)
Dyadic obligations: proofs and countermodels via hypersequents
por: Ciabattoni, Agata, et al.
Publicado: (2024)
por: Ciabattoni, Agata, et al.
Publicado: (2024)
An algebraic theory of ω-regular languages, via μν-expressions
por: Das, Anupam, et al.
Publicado: (2025)
por: Das, Anupam, et al.
Publicado: (2025)
List types for resource aware languages: an implicit name approach
por: Ghilezan, Silvia, et al.
Publicado: (2021)
por: Ghilezan, Silvia, et al.
Publicado: (2021)
Bringing closure to theory combination properties
por: Toledo, Guilherme V., et al.
Publicado: (2026)
por: Toledo, Guilherme V., et al.
Publicado: (2026)
Undecidability of theories of semirings with fixed points
por: Das, Anupam, et al.
Publicado: (2025)
por: Das, Anupam, et al.
Publicado: (2025)
OSVAuto: automatic proofs about functional specifications in OS verification
por: Wu, Yulun, et al.
Publicado: (2024)
por: Wu, Yulun, et al.
Publicado: (2024)
The Leibniz adjunction in homotopy type theory, with an application to simplicial type theory
por: de Jong, Tom, et al.
Publicado: (2026)
por: de Jong, Tom, et al.
Publicado: (2026)
Strong negation in the theory of computable functionals TCF
por: Köpp, Nils, et al.
Publicado: (2022)
por: Köpp, Nils, et al.
Publicado: (2022)
On proving consistency of equational theories in Bounded Arithmetic
por: Beckmann, Arnold, et al.
Publicado: (2022)
por: Beckmann, Arnold, et al.
Publicado: (2022)
How (and when) can you fit examples to logic-based hypothesis classes over infinite structures?
por: Benedikt, Michael, et al.
Publicado: (2026)
por: Benedikt, Michael, et al.
Publicado: (2026)
From learnable objects to learnable random objects
por: Anderson, Aaron, et al.
Publicado: (2025)
por: Anderson, Aaron, et al.
Publicado: (2025)
Ejemplares similares
-
The equational theory of the Weihrauch lattice with (iterated) composition
por: Pradic, Cécilia
Publicado: (2024) -
Synthesizing Strongly Equivalent Logic Programs: Beth Definability for Answer Set Programs via Craig Interpolation in First-Order Logic
por: Heuer, Jan, et al.
Publicado: (2024) -
The equational theory of the Weihrauch lattice with multiplication
por: Neumann, Eike, et al.
Publicado: (2024) -
The Myhill isomorphism theorem does not generalize much
por: Pradic, Cécilia
Publicado: (2025) -
Generating Theorems by Generating Proof Structures
por: Wernhard, Christoph
Publicado: (2026)