Displaying similar documents to “Automated theorem proving in monadic predicate calculus”

Cocktail: a tool for deriving correct programs.

Michael Franssen, Harrie De Swart (2004)

RACSAM

Similarity:

Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying...

Rule-Generation Theorem and its Applications

Andrzej Indrzejczak (2018)

Bulletin of the Section of Logic

Similarity:

In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical theories via rules of special sort was developed successfully by Negri and von Plato. In this paper a general theorem on possible ways of transforming axiomatic sequents into rules in sequent calculi is proved. We discuss its possible applications and provide some...

The Method of Socratic Proofs Meets Correspondence Analysis

Dorota Leszczyńska-Jasion, Yaroslav Petrukhin, Vasilyi Shangin (2019)

Bulletin of the Section of Logic

Similarity:

The goal of this paper is to propose correspondence analysis as a technique for generating the so-called erotetic (i.e. pertaining to the logic of questions) calculi which constitute the method of Socratic proofs by Andrzej Wiśniewski. As we explain in the paper, in order to successfully design an erotetic calculus one needs invertible sequent-calculus-style rules. For this reason, the proposed correspondence analysis resulting in invertible rules can constitute a new foundation for...

Empirical Negation, Co-negation and Contraposition Rule I: Semantical Investigations

Satoru Niki (2020)

Bulletin of the Section of Logic

Similarity:

We investigate the relationship between M. De's empirical negation in Kripke and Beth Semantics. It turns out empirical negation, as well as co-negation, corresponds to different logics under different semantics. We then establish the relationship between logics related to these negations under unified syntax and semantics based on R. Sylvan's CCω.

Intuitionistic logic considered as an extension of classical logic : some critical remarks

Javier Legris, Jorge A. Molina (2001)

Philosophia Scientiae

Similarity:

In this paper we analyze the consideration of intuitionistic logic as an extension of classical logic. This — at first sight surprising — point of view has been sustained explicitly by Jan Łukasiewicz on the basis of a mapping of classical propositional logic into intuitionistic propositional logic by Kurt Gödel in 1933. Simultaneously with Gödel, Gerhard Gentzen had proposed another mapping of Peano´s arithmetic into Heyting´s arithmetic. We shall discuss these mappings in connection...