scholarly journals Theorem Proving for Logic with Partial Functions Using Kleene Logic and Geometric Logic

10.29007/6qpn ◽  
2018 ◽  
Author(s):  
Hans De Nivelle

We introduce a theorem proving strategy for Partial Classical Logic (PCL) thatis based on geometric logic. The strategy first translates PCL theories into sets of Kleene formulas. After that, the Kleene formulas are translated into 3-valued geometric logic. The resulting formulas can be refuted by an adaptation ofgeometric resolution.The translation to Kleene logic does not only open the way to theorem proving, butit also sheds light on the relation between PCL, Kleene Logic, and classical logic.

2021 ◽  
pp. 1-15
Author(s):  
Geoff Sutcliffe

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.


2011 ◽  
Vol 47 (4) ◽  
pp. 399-425 ◽  
Author(s):  
Hans de Nivelle

2014 ◽  
Vol 94 ◽  
pp. 238-252
Author(s):  
Cliff B. Jones ◽  
Matthew J. Lovert ◽  
L. Jason Steggles

10.29007/b7wc ◽  
2018 ◽  
Author(s):  
Issam Maamria ◽  
Michael Butler

Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised proof tactics for rewriting. This results in an interleaving between deduction and computation (i.e., rewriting) steps. If the logic of reasoning supports partial functions, it is necessary that rewriting copes with potentially ill-defined terms. In this paper, we provide a basis for integrating rewriting with a deductive proof system that deals with well-definedness. The definitions and theorems presented in this paper are the theoretical foundations for an extensible rewriting-based prover that has been implemented for the set theoretical formalism Event-B.


AI Magazine ◽  
2016 ◽  
Vol 37 (2) ◽  
pp. 99-101 ◽  
Author(s):  
Geoff Sutcliffe

The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic automated theorem proving (ATP) systems for classical logic — the world championship for such systems. CASC provides a public evaluation of the relative capabilities of ATP systems, and aims stimulate ATP research towards the development of more powerful ATP systems. Over the years CASC has been a catalyst for impressive improvements in ATP.


2018 ◽  
Vol 12 (1) ◽  
pp. 1-29
Author(s):  
GREG RESTALL

AbstractIn this paper, I motivate a cut free sequent calculus for classical logic with first order quantification, allowing for singular terms free of existential import. Along the way, I motivate a criterion for rules designed to answer Prior’s question about what distinguishes rules for logical concepts, like conjunction from apparently similar rules for putative concepts like Prior’s tonk, and I show that the rules for the quantifiers—and the existence predicate—satisfy that condition.


Lab on a Chip ◽  
2012 ◽  
Vol 12 (10) ◽  
pp. 1841 ◽  
Author(s):  
Seung Hwan Lee ◽  
Danny van Noort ◽  
Kyung-Ae Yang ◽  
In-Hee Lee ◽  
Byoung-Tak Zhang ◽  
...  

2018 ◽  
Vol 41 ◽  
Author(s):  
Maria Babińska ◽  
Michal Bilewicz

AbstractThe problem of extended fusion and identification can be approached from a diachronic perspective. Based on our own research, as well as findings from the fields of social, political, and clinical psychology, we argue that the way contemporary emotional events shape local fusion is similar to the way in which historical experiences shape extended fusion. We propose a reciprocal process in which historical events shape contemporary identities, whereas contemporary identities shape interpretations of past traumas.


Sign in / Sign up

Export Citation Format

Share Document