First-order reasoning and efficient semi-algebraic proofs

, &
Annals of Pure and Applied Logic 176 (1):103496 (2025)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2024.103496

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,824

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Algebraic properties of the first-order part of a problem.Giovanni Soldà & Manlio Valenti - 2023 - Annals of Pure and Applied Logic 174 (7):103270.
Wellfoundedness proofs by means of non-monotonic inductive definitions II: first order operators.Toshiyasu Arai - 2010 - Annals of Pure and Applied Logic 162 (2):107-143.
The notion of independence in categories of algebraic structures, part III: equational classes.Gabriel Srour - 1990 - Annals of Pure and Applied Logic 47 (3):269-294.
The notion of independence in categories of algebraic structures, Part I: Basic properties.M. Srour - 1988 - Annals of Pure and Applied Logic 38 (2):185.
The notion of independence in categories of algebraic structures, part II: S-minimal extensions.Gabriel Srour - 1988 - Annals of Pure and Applied Logic 39 (1):55-73.
Analytic logic of proofs.Francesca Poggiolesi & Brian Hill - forthcoming - Annals of Pure and Applied Logic.
On arithmetical completeness of the logic of proofs.Sohei Iwata & Taishi Kurahashi - 2019 - Annals of Pure and Applied Logic 170 (2):163-179.
Algebraic combinatorics in bounded induction.Joaquín Borrego-Díaz - 2021 - Annals of Pure and Applied Logic 172 (2):102885.
The semantic isomorphism theorem in abstract algebraic logic.Tommaso Moraschini - 2016 - Annals of Pure and Applied Logic 167 (12):1298-1331.
The machinery of consistency proofs.Mariko Yasugi - 1989 - Annals of Pure and Applied Logic 44 (1-2):139-152.

Analytics

Added to PP
2024-07-16

Downloads
9 (#1,607,899)

6 months
3 (#1,188,186)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The proof complexity of linear algebra.Michael Soltys & Stephen Cook - 2004 - Annals of Pure and Applied Logic 130 (1-3):277-323.
Short propositional refutations for dense random 3CNF formulas.Sebastian Müller & Iddo Tzameret - 2014 - Annals of Pure and Applied Logic 165 (12):1864-1918.

View all 8 references / Add more references