What do we know when we know that a theory is consistent?

05/17/2023
by   Gilles Dowek, et al.
0

Given a first-order theory and a proof that it is consistent, can we design a proof-search method for this theory that fails in finite time when it attempts to prove the formula False?

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2022

Improving Counterexample Quality from Failed Program Verification

In software verification, a successful automated program proof is the ul...
research
07/29/2021

Syllepsis in Homotopy Type Theory

It is well-known that in homotopy type theory (HoTT), one can prove the ...
research
03/05/2023

Some D-finite and Some Possibly D-finite Sequences in the OEIS

In an automatic search, we found conjectural recurrences for some sequen...
research
01/13/2023

Correlation-Based And-Operations Can Be Copulas: A Proof

In many practical situations, we know the probabilities a and b of two e...
research
05/18/2023

Universal Proof Theory, TACL 2022 Lecture Notes

The subject of these short lecture notes is a recently emerging area wit...
research
05/30/2023

The Stratified Foundations as a theory modulo

The Stratified Foundations are a restriction of naive set theory where t...
research
02/08/2022

Natural Language Proof Checking in Introduction to Proof Classes – First Experiences with Diproche

We present and analyze the employment of the Diproche system, a natural ...

Please sign up or login with your details

Forgot password? Click here to reset