A universally free logic is a system of quantification theory, with or without identity, whose theses remain logically true if the domain of quantification is empty and some of the singular terms present in the language do not denote existing objects. In the West, logics satisfying and ones satisfying were developed starting in the 1950s. But Stanisław Jaśkowski preceded all this work by some twenty years: his paper “On the Rules of Supposition in Formal Logic” of 1934 can be regarded (...) as containing, at least implicitly, the first universally free logic. The system proposed there is an inclusive logic as it is, and a straightforward extension of it is also free. (shrink)

One of the characteristic features of contemporary logic is that it incorporates the Frege‐Russell thesis according to which verbs for being are multiply ambiguous. This thesis was not accepted before the nineteenth century. In Aristotle existence could not serve alone as a predicate term. However, it could be a part of the force of the predicate term, depending on the context. For Kant existence could not even be a part of the force of the predicate term. Hence, after Kant, existence (...) was left homeless. It found a home in the algebra of logic in which the operators corresponding to universal and particular judgments were treated as duals, and universal judgments were taken to be relative to some universe of discourse. Because of the duality, existential quantifier expressions came to express existence. The orphaned notion of existence thus found a new home in the existential quantifier. (shrink)

We develop a bottom-up approach to truth-value semantics for classical logic of partial terms based on equality and apply it to prove the conservativity of the addition of partial description and selection functions, independently of any strictness assumption.

Je vais traiter ici des inférences dont la validité tient au rôle qu'y jouent les cinq connecteurs « ⊃ », « ∼ », « & », « V » et « ≡ », les deux quantificateurs « ∀ » et « ∃ », et le signe d'identité « = ». Qu'on me permette de rappeler que les deux conjectures présentéd dans ma première étude se sont avéré'es justes. En premier lieu, toute règle de structure et toute règie d'élimination ou d'introduction (...) pour « & » ou « V » qui vaut pour la logique classique des connecteurs vaut également pour la logique intuitionniste des connecteurs. En second lieu, tout énoncé du genre A1, A2, …, An ⊢ B qui vaut pour la logique classique des connecteurs peut s'obtenir exclusivement à l'aide des règles de structure R, P, E, S, et des règles d'elimination et d'introduction pour ceux des connecteurs « ⊃ », « ∼ », « & », « V » et « ≡ » qui figurent dans A1, A2, …, An, et B. (shrink)

Gentzen’s and Jaśkowski’s formulations of natural deduction are logically equivalent in the normal sense of those words. However, Gentzen’s formulation more straightforwardly lends itself both to a normalization theorem and to a theory of “meaning” for connectives . The present paper investigates cases where Jaskowski’s formulation seems better suited. These cases range from the phenomenology and epistemology of proof construction to the ways to incorporate novel logical connectives into the language. We close with a demonstration of this latter aspect by (...) considering a Sheffer function for intuitionistic logic. (shrink)

Partial functions are ubiquitous in both mathematics and computer science. Therefore, it is imperative that the underlying logical formalism for a general-purpose mechanized mathematics system provide strong support for reasoning about partial functions. Unfortunately, the common logical formalisms — first-order logic, type theory, and set theory — are usually only adequate for reasoning about partial functionsin theory. However, the approach to partial functions traditionally employed by mathematicians is quite adequatein practice. This paper shows how the traditional approach to partial functions (...) can be formalized in a range of formalisms that includes first-order logic, simple type theory, and Von-Neumann—Bernays—Gödel set theory. It argues that these new formalisms allow one to directly reason about partial functions; are based on natural, well-understood, familiar principles; and can be effectively implemented in mechanized mathematics systems. (shrink)