Displaying similar documents to “Two Treatments of Definite Descriptions in Intuitionist Negative Free Logic”

A Binary Quantifier for Definite Descriptions in Intuitionist Negative Free Logic: Natural Deduction and Normalisation

Nils Kürbis (2019)

Bulletin of the Section of Logic

Similarity:

This paper presents a way of formalising definite descriptions with a binary quantifier ℩, where ℩x[F, G] is read as `The F is G'. Introduction and elimination rules for ℩ in a system of intuitionist negative free logic are formulated. Procedures for removing maximal formulas of the form ℩x[F, G] are given, and it is shown that deductions in the system can be brought into normal form.

Empirical Negation, Co-Negation and the Contraposition Rule II: Proof-Theoretical Investigations

Satoru Niki (2020)

Bulletin of the Section of Logic

Similarity:

We continue the investigation of the first paper where we studied logics with various negations including empirical negation and co-negation. We established how such logics can be treated uniformly with R. Sylvan's CCω as the basis. In this paper we use this result to obtain cut-free labelled sequent calculi for the logics.

A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs

George Tourlakis (2016)

Bulletin of the Section of Logic

Similarity:

Reference [12] introduced a novel formula to formula translation tool (“formula-tors”) that enables syntactic metatheoretical investigations of first-order modallogics, bypassing a need to convert them first into Gentzen style logics in order torely on cut elimination and the subformula property. In fact, the formulator tool,as was already demonstrated in loc. cit., is applicable even to the metatheoreticalstudy of logics such as QGL, where cut elimination is (provably, [2]) unavailable....

Identity, Equality, Nameability and Completeness

María Manzano, Manuel Crescencio Moreno (2017)

Bulletin of the Section of Logic

Similarity:

This article is an extended promenade strolling along the winding roads of identity, equality, nameability and completeness, looking for places where they converge. We have distinguished between identity and equality; the first is a binary relation between objects while the second is a symbolic relation between terms. Owing to the central role the notion of identity plays in logic, you can be interested either in how to define it using other logical concepts or in the opposite scheme....

Super-strict Implications

Guido Gherardi, Eugenio Orlandelli (2021)

Bulletin of the Section of Logic

Similarity:

This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the...

Identity, equality, nameability and completeness. Part II

María Manzano, Manuel Crescencio Moreno (2018)

Bulletin of the Section of Logic

Similarity:

This article is a continuation of our promenade along the winding roads of identity, equality, nameability and completeness. We continue looking for a place where all these concepts converge. We assume that identity is a binary relation between objects while equality is a symbolic relation between terms. Identity plays a central role in logic and we have looked at it from two different points of view. In one case, identity is a notion which has to be defined and, in the other case, identity...

Logic of existence and logic of knowledge. Epistemic and non epistemic aspects of logic

Michel Bourdeau (2003)

Philosophia Scientiae

Similarity:

Contrairement à ce qui a parfois été dit, la logique classique et la logique intuitionniste ne s’opposent pas comme une logique de l’existence à une logique de la connaissance. Les considérations épistémologiques trouvent naturellement leur place dans le cadre de la logique classique, sans qu’il soit nécessaire de faire intervenir aucun principe intuitionniste ; il suffit pour cela de reconnaître que la logique ne peut se passer de la notion d’assertion, ou si l’on préfère de jugement....

Simple Decision Procedure for S5 in Standard Cut-Free Sequent Calculus

Andrzej Indrzejczak (2016)

Bulletin of the Section of Logic

Similarity:

In the paper a decision procedure for S5 is presented which uses a cut-free sequent calculus with additional rules allowing a reduction to normal modal forms. It utilizes the fact that in S5 every formula is equivalent to some 1-degree formula, i.e. a modally-flat formula with modal functors having only boolean formulas in its scope. In contrast to many sequent calculi (SC) for S5 the presented system does not introduce any extra devices. Thus it is a standard version of SC but with...

Algebraic Approach to Algorithmic Logic

Grzegorz Bancerek (2014)

Formalized Mathematics

Similarity:

We introduce algorithmic logic - an algebraic approach according to [25]. It is done in three stages: propositional calculus, quantifier calculus with equality, and finally proper algorithmic logic. For each stage appropriate signature and theory are defined. Propositional calculus and quantifier calculus with equality are explored according to [24]. A language is introduced with language signature including free variables, substitution, and equality. Algorithmic logic requires a bialgebra...

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...

Grzegorczyk’s Logics. Part I

Taneli Huuskonen (2015)

Formalized Mathematics

Similarity:

This article is the second in a series formalizing some results in my joint work with Prof. Joanna Golinska-Pilarek ([9] and [10]) concerning a logic proposed by Prof. Andrzej Grzegorczyk ([11]). This part presents the syntax and axioms of Grzegorczyk’s Logic of Descriptions (LD) as originally proposed by him, as well as some theorems not depending on any semantic constructions. There are both some clear similarities and fundamental differences between LD and the non-Fregean logics introduced...

A Post-style proof of completeness theorem for symmetric relatedness Logic S

Mateusz Klonowski (2018)

Bulletin of the Section of Logic

Similarity:

One of the logic defined by Richard Epstein in a context of an analysis of subject matter relationship is Symmetric Relatedness Logic S. In the monograph [2] we can find some open problems concerning relatedness logic, a Post-style completeness theorem for logic S is one of them. Our paper introduces a solution of this metalogical issue.

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...