Switch to: References

Add citations

You must login to add citations.
  1. Operator Counterparts of Types of Reasoning.Urszula Wybraniec-Skardowska - 2023 - Logica Universalis 17 (4):511-528.
    Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Some non-standard interpretations of the axiomatic basis of Leśniewski’s Ontology.Rafał Urbaniak - 2006 - Australasian Journal of Logic 4 (5):13-46.
    We propose an intuitive understanding of the statement: ‘an axiom (or: an axiomatic basis) determines the meaning of the only specific constant occurring in it.’ We introduce some basic semantics for functors of the category s/n,n of Lesniewski’s Ontology. Using these results we prove that the popular claim that the axioms of Ontology determine the meaning of the primitive constants is false.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Znaczenie pojęcia odrzucania we współczesnej logice.Karolina Rożko - 2014 - Diametros 41:115-126.
    The main aim of this article is to show how the notion of refutation has been changing in logic for the last few years. The idea of refutation was known to Aristotle, but the formal concept was introduced by Jan Łukasiewicz. Afterwards this notion was investigated by the Polish group of logicians headed by Jerzy Słupecki. Several interesting articles about refutation have appeared in the last years. In this article, I present in outline the history of the notion of refutation (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Mereological sets of distributive classes.Andrzej Pietruszczak - 1996 - Logic and Logical Philosophy 4:105-122.
    We will present an elementary theory in which we can speak of mereological sets composed of distributive classes. Besides the concept of a distributive class and the membership relation , it will possess the notion of a mereological set and the relation of being a mereological part. In this theory we will interpret Morse’s elementary set theory (cf. Morse [11]). We will show that our theory has a model, if only Morse’s theory has one.
    Download  
     
    Export citation  
     
    Bookmark  
  • On Minimal Models for Pure Calculi of Names.Piotr Kulicki - 2013 - Logic and Logical Philosophy 22 (4):429–443.
    By pure calculus of names we mean a quantifier-free theory, based on the classical propositional calculus, which defines predicates known from Aristotle’s syllogistic and Leśniewski’s Ontology. For a large fragment of the theory decision procedures, defined by a combination of simple syntactic operations and models in two-membered domains, can be used. We compare the system which employs `ε’ as the only specific term with the system enriched with functors of Syllogistic. In the former, we do not need an empty name (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A meta-logic of inference rules: Syntax.Alex Citkin - 2015 - Logic and Logical Philosophy 24 (3).
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Remarks on Axiomatic Rejection in Aristotle’s Syllogistic.Piotr Kulicki - 2002 - Studies in Logic and Theory of Knowledge 5:231-236.
    In the paper we examine the method of axiomatic rejection used to describe the set of nonvalid formulae of Aristotle's syllogistic. First we show that the condition which the system of syllogistic has to fulfil to be ompletely axiomatised, is identical to the condition for any first order theory to be used as a logic program. Than we study the connection between models used or refutation in a first order theory and rejected axioms for that theory. We show that any (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations