. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On the other (...) hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

This superb collection of papers focuses on a fundamental question in logic and computation: What is a logical system? With contributions from leading researchers--including Ian Hacking, Robert Kowalski, Jim Lambek, Neil Tennent, Arnon Avron, L. Farinas del Cerro, Kosta Dosen, and Solomon Feferman--the book presents a wide range of views on how to answer such a question, reflecting current, mainstream approaches to logic and its applications. Written to appeal to a diverse audience of readers, What is a Logical (...) System? will excite discussion among students, teachers, and researchers in mathematics, logic, computer science, philosophy, and linguistics. (shrink)

This book addresses the hasty development of modern logic, especially its introducing and embracing various kinds of artificial languages and moving from the study of natural languages to that of artificial ones. This shift seemed extremely helpful and managed to elevate logic to a new level of rigor and clarity. However, the change that logic underwent in this way was in no way insignificant, and it is also far from an insignificant matter to determine to what extent the "new logic" (...) only engaged new and more powerful instruments to answer the questions posed by the "old" one, and to what extent it replaced these questions with new ones. Hence, this movement has generated brand new kinds of philosophical problems that have still not been dealt with systematically. Philosophy of Logical Systems addresses these new kinds of philosophical problems that are intertwined with the development of modern logic. Jaroslav Peregrin analyzes the rationale behind the introduction of the artificial languages of logic; classifies the various tools which were adopted to build such languages; gives an overview of the various kinds of languages introduced in the course of modern logic and the motifs of their employment; discusses what can actually be achieved by relocating the problems of logic from natural language into them; and reaches certain conclusions with respect to the possibilities and limitations of this "formal turn" of logic. This book is both an important scholarly contribution to the philosophy of logic and a systematic survey of the standard logical systems that were established during the short history of modern logic. (shrink)

This paper aims at clarifying the nature of Frege's system of logic, as presented in the first volume of the Grundgesetze. We undertake a rational reconstruction of this system, by distinguishing its propositional and predicate fragments. This allows us to emphasise the differences and similarities between this system and a modern system of classical second-order logic.

The main objective o f this descriptive paper is to present the general notion of translation between logical systems as studied by the GTAL research group, as well as its main results, questions, problems and indagations. Logical systems here are defined in the most general sense, as sets endowed with consequence relations; translations between logical systems are characterized as maps which preserve consequence relations (that is, as continuous functions between those sets). In this sense, (...) logics together with translations form a bicomplete category of which topological spaces with topological continuous functions constitute a full subcategory. We also describe other uses of translations in providing new semantics for non-classical logics and in investigating duality between them. An important subclass of translations, the conservative translations, which strongly preserve consequence relations, is introduced and studied. Some specific new examples of translations involving modal logics, many-valued logics, para- consistent logics, intuitionistic and classical logics are also described. (shrink)

This thorough investigation of the implications, both logical and philosophical, of Lesniewski's systems should do much to arouse interest in this neglected Polish philosopher. The author takes great pains to relate Lesniewski's ideas to those prevailing today in "orthodox" circles of logicians. There is an excellent bibliography.—A. E. F.

Doubts concerning the validity of logic are as old as the empirical criticism of science. In the last two decades the idea that truth is relative to given sets of basic assumptions has been prominent; and the controversy about the principle of excluded middle has focussed renewed attention upon the nature of logic and its fundamental principles.Recent investigations in formal logic have contributed greatly to the understanding of the principles of logic. It is simply a misunderstanding to conclude from them (...) that the logical principles have been suspended, despite the various formal structures which are called “logics.” The purely formal treatment of problems concerning the foundations of logic, while necessarily undertaken as far as it can go, has essential limitations. (shrink)

This paper investigates modular combinations of temporal logic systems. Four combination methods are described and studied with respect to the transfer of logical properties from the component one-dimensional temporal logics to the resulting combined two-dimensional temporal logic. Three basic logical properties are analyzed, namely soundness, completeness, and decidability. Each combination method comprises three submethods that combine the languages, the inference systems, and the semantics of two one-dimensional temporal logic systems, generating families of two-dimensional temporal languages (...) with varying expressivity and varying degrees of transfer of logical properties. The temporalization method and the independent combination method are shown to transfer all three basic logical properties. The method of full join of logic systems generates a considerably more expressive language but fails to transfer completeness and decidability in several cases. So a weaker method of restricted join is proposed and shown to transfer all three basic logical properties. (shrink)

The thesis that the two-valued system of classical logic is insufficient to explanation the various intermediate situations in the entity, has led to the development of many-valued and fuzzy logic systems. These systems suggest that this limitation is incorrect. They oppose the law of excluded middle (tertium non datur) which is one of the basic principles of classical logic, and even principle of non-contradiction and argue that is not an obstacle for things both to exist and to not (...) exist at the same time. However, contrary to these claims, there is no inadequacy in the two-valued system of classical logic in explanation the intermediate situations in existence. The law of exclusion and the intermediate situations in the external world are separate things. The law of excluded middle has been inevitably accepted by other logic systems which are considered to reject this principle. The many-valued and the fuzzy logic systems do not transcend the classical logic. Misconceptions from incomplete information and incomplete research are effective in these criticisms. In addition, it is also effective to move the discussion about the intellectual conception (tasawwur) into the field of judgmental assent (tasdiq) and confusion of the mawhum (imaginable) with the ma‘kûl (intellegible). (shrink)

Josiah Royce (1855?1916) was, in addition to being the pre-eminent metaphysician at the turn of the 19th century in the USA, regarded as ?a logician of the first rank?. At the time of his death in 1916, he had begun a substantial and potentially revolutionary project in logic in which he sought to show the connection between logic and ethics, aesthetics, and metaphysics. His system was developed in light of the work of Bertrand Russell and A. B. Kempe and aimed (...) to include Russell's logic as a subsystem. This more comprehensive logic, which Royce called system Σ, brought together an analysis of the character of experience and knowledge with the principles which served to organize interests and direct actions. The result was to be a logical theory framed by ?a profoundly ethical motive as well as a genuinely intellectual one? that would serve as ?a theory of the way in which activities must go on if they go on at all?. This paper examines three stages in the development of Royce's logical system, its relation to the logic of Principia Mathematica, and prospects for its further development. (shrink)

In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. Da Costa’s approach has led to the family of logics (...) of formal (in)consistency (LFIs). In this paper we provide in a modular way simple non-deterministic semantics for 64 of the most important logics from this family. Our semantics is 3-valued for some of the systems, and infinite-valued for the others. We prove that these results cannot be improved: neither of the systems with a three-valued non-deterministic semantics has either a finite characteristic ordinary matrix or a two-valued characteristic non-deterministic matrix, and neither of the other systems we investigate has a finite characteristic non-deterministic matrix. Still, our semantics provides decision procedures for all the systems investigated, as well as easy proofs of important proof-theoretical properties of them. (shrink)

As part of our small contribution in dialogue toward better peace development and reconciliation studies, and following Toffler & Toffler’s War and Antiwar (1993), the present article delves into a realm of logic beyond the traditional confines of negation and the excluded middle principle, exploring the nuances of "Otherness" that transcend classical and Nagatomo logics. Departing from the foundational premises of classical Aristotelian logic systems, this exploration ventures into alternative realms of reasoning, specifically examining Neutrosophic Logic and Klein bottle (...) logic (cf. Smarandache, 2005). The study challenges conventional boundaries and explores the implications of embracing paradoxes and self-reference in logic systems, aiming to redefine approaches to understanding truth and reasoning. The paper investigates how these alternative logics open avenues for philosophical inquiry, redefining entropy, and potentially influencing innovative perspectives in free energy systems. Through this exploration, it seeks to expand the discourse on logic, welcoming a broader spectrum of thought beyond established frameworks; and we also discuss shortly a number of possible implementations including in risk management and also Klein bottle entropy redefinition (Tang et al, 2018). (shrink)

An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of Gentzen-type systems which in addition to the standard axioms and structural rules have only logical rules in which exactly one occurrence of a quantifier is introduced. The semantics for these systems is provided using two-valued non-deterministic matrices, a generalization of the classical matrix. In this paper we use a (...) constructive syntactic criterion of coherence to characterize strong cutelimination in such systems. We show that the following properties of a canonical system G with arbitrary (n, k)-ary quantifiers are equivalent: (i) G is coherent, (ii) G admits strong cut-elimination, and (iii) G has a strongly characteristic two-valued generalized non-deterministic matrix. In addition, we define simple calculi, an important subclass of canonical calculi, for which coherence is equivalent to the weaker, standard cut-elimination property. (shrink)

Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calculi labelled with truth values and with a semantics based on a two-sorted algebra allowing, in particular, the representation of general Kripke structures. A wide variety of logics, including non-classical logics like, for instance, modal logics and intuitionistic logic can be presented by logic systems of this kind. A categorical approach (...) of fusion is defined in the context of these logic systems. Preservation of soundness and completeness by fusion is studied. Soundness is preserved without further requirements, completeness is preserved under mild assumptions. (shrink)

Stanislaw Lesniewski’s interests were, for the most part, more philosophical than mathematical. Prior to taking his doctorate at Jan Kazimierz University in Lvov, Lesniewski had spent time at several continental universities, apparently becoming relatively attached to the philosophy of one of his teachers, Hans Comelius, to the chapters of John Stuart Mill’s System of Logic that dealt specifically with semantics, and, in general, to studies of general grammar and philosophy of language. In these several early interests are already to be (...) found the roots of the work that was to occupy Lesniewski’s life: a search for a definitive doctrine of what sorts of things there are in the world, or better, of what language must be like if it is adequately and efficiently to represent the world. (shrink)

We introduce a methodology whereby an arbitrary logic system L can be enriched with temporal features to create a new system T(L). The new system is constructed by combining L with a pure propositional temporal logic T (such as linear temporal logic with Since and Until) in a special way. We refer to this method as adding a temporal dimension to L or just temporalising L. We show that the logic system T(L) preserves several properties of the original temporal logic (...) like soundness, completeness, decidability, conservativeness and separation over linear flows of time. We then focus on the temporalisation of first-order logic, and a comparison is make with other first-order approaches to the handling of time. (shrink)

According to Suszko’s Thesis, there are but two logical values, true and false. In this paper, R. Suszko’s, G. Malinowski’s, and M. Tsuji’s analyses of logical twovaluedness are critically discussed. Another analysis is presented, which favors a notion of a logical system as encompassing possibly more than one consequence relation. [A] fundamental problem concerning many-valuedness is to know what it really is. [13, p. 281].

Logical pluralism is a general idea that there is more than one correct logic. Carnielli and Rodrigues [2019a] defend an epistemic interpretation of the paraconsistent logic N4, according to which an argument is valid in this logic just in case it necessarily preserves evidence. The authors appeal to this epistemic interpretation to briefly motivate a kind of logical pluralism: “different accounts of logical consequence may preserve different properties of propositions”. The aim of this paper is to study (...) the prospect of a logical pluralism based on different interpretations of logical systems. First, we give our analysis of what it means to interpret a logic – and make some hopefully useful distinctions along the way. Second, we present what we call an interpretational logical pluralism: there is more than one correct logic and a logic is correct only if it has some adequate interpretation. We consider four variants of this idea, bring up some possible objections, and try to find plausible solutions on behalf of the pluralist. We will argue that interpretations of logical systems provide a promising – albeit not unproblematic – route to logical pluralism. (shrink)

"Lesniewski defined ontology, one of his three foundational systems, as 'a certain kind of modernized 'traditional logic' [On the foundations of mathematics (FM), p. 176]. In this respect it is worth bearing in mind that in the 1937-38 academic year Lesniewski taught a course called "Traditional 'formal logic' and traditional 'set theory' on the ground of ontology"; cf. Srzednicki and Stachniak, S. Lesniewski's Systems. Protothetic, 1988, p. 180. On this see Kotarbinski Gnosiology. The scientific approach to the theory (...) of knowledge, 1966, pp. 253-54 [the Polish original was published in 1929], which Lesniewski praised in [FM]: see in particular pp. 373 ff. Kotarbinski noted that Lesniewski "calls his system 'ontology' in harmony with certain terms used earlier (as in.. (shrink)

In this paper we propose a conditional logic called IBC to represent iterated belief revision systems. We propose a set of postulates for iterated revision which are a small variant of Darwiche and Pearl's ones. The conditional logic IBC has a standard semantics in terms of selection function models and provides a natural representation of epistemic states. We establish a correspondence between iterated belief revision systems and IBC-models. Our representation theorem does not entail Gärdenfors' Triviality Result.

Logical works of this period, beginning with Generales Inquisitiones and ending wi th the two dated pieces of 1 Aug. 1690 and 2 Aug. 1690, are read as a sustained effort, finally successful, to develop a set of axioms and an appropriate schema for the expression of categorical propositions faithful to traditional syllogistic. This same set of axioms is shown to be comprehensive of the propositional calculus of Principia Mathematica, providing that ‘Some A is A’ is not a thesis (...) in an unrestricted sense. There is no indication in the works of this period that Leibniz understood just how significant is this logicalsystem he developed. But it is undeniable that he held tenaciously to this particular set of axioms throughout the period, a set of axioms of great power. (shrink)

The notion of belongingness in African philosophy has its most profound expression in Pantaleon Iroegbu’s uwa ontology, which stipulates that being is that which exists in the community, or, as he puts it, “To be is to belong.” The main contention of this article is that Jonathan O. Chimakonam’s ezumezu logic is fully equipped to explain this ontology of belongingness. This is due to the trivalent and dynamic nature of this African culture–inspired logic, which adequately captures the African conception of (...) reality. According to this conception, individual entities continue to coexist or to belong in the community without losing their respective identities. (shrink)

In this paper we define and study a generalized notion of a logical system that covers on an equal formal basis sentential, equational and sequential systems. We develop a general theory of equivalence between generalized logics that provides, first, a conception of algebraizable logic , second, a formal concept of equivalence between sequential systems and, third, a notion of equivalence between sentential and sequential systems. We also use our theory of equivalence for developing a general algebraic (...) approach to conjunctive non-pseudo-axiomatic self-extensional sentential logics. Finally, we consider within the framework of the mentioned approach various sequential formulations for some well-known sentential logics. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense reasoning, expert systems (...) implementation, deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

David Lewis employed $${\Box }{\rightarrow }$$ and $$\preccurlyeq $$ as the primitive connectives, respectively, to establish two different kinds of conditional logic systems, which can be demonstrated to be equivalent. Unfortunately, Lewis and his successors relied solely on an intuitive sphere semantic model to ascertain their equivalence, failing to provide a formal proof. A formal clarification of the relationship between these different logical systems is pivotal for intuitively grasping and comprehending them and their interconnections. Hence, the aim (...) of this paper is to provide a rigorous equivalence proof between Lewis’ two kinds of conditional systems: CO and C1, as well as V and VC. Through our proof, we show that the Connex axiom is redundant within System V and give its derivation from the other rules and axioms. This indicates that the connective $$\preccurlyeq $$ is more foundational than Lewis anticipated, and has precedence over other conditional connectives. Furthermore, we propose four semantics for $$\preccurlyeq $$, some of which were not previously posited by Lewis, and examine the potential for extending $$\preccurlyeq $$ to other logics. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human reasoning. (...) Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Bernard Bolzano was born in Prague in 1781 and died in 1848 in the same city1. His major work Wissenschaftslehre was published in 1837 in Sulzbach, Germany.Since the publication of Jan Berg’s Bolza...

Interval type-2 fuzzy logic systems have favorable abilities to cope with uncertainties in many applications. While the block type-reduction under the guidance of inference plays the central role in the systems, Karnik-Mendel iterative algorithms are standard algorithms to perform the type-reduction; however, the high computational cost of type-reduction process may hinder them from real applications. The comparison between the KM algorithms and other alternative algorithms is still an open problem. This paper introduces the related theory of interval type-2 (...) fuzzy sets and discusses the blocks of fuzzy reasoning, type-reduction, and defuzzification of interval type-2 fuzzy logic systems by combining the Nagar-Bardini and Nie-Tan noniterative algorithms for solving the centroids of output interval type-2 fuzzy sets. Moreover, the continuous version of NT algorithms is proved to be accurate algorithms for performing the type-reduction. Four computer simulation examples are provided to illustrate and analyze the performances of two kinds of noniterative algorithms. The NB and NT algorithms are superior to the KM algorithms on both calculation accuracy and time, which afford the potential application value for designer and adopters of type-2 fuzzy logic systems. (shrink)

In 1969, Lindström proved his celebrated theorem characterizing first-order logic and established criteria for the first-order definability of formal theories for discrete structures. Barwise, Shelah, Väänänen, and others extended Lindström’s characterizability program to classes of infinitary logic systems, including a recent paper by Džamonja and Väänänen on Karp’s chain logic, which satisfies interpolation, undefinability of well-order, and is maximal in the class of logic systems with these properties. From the perspective of the article analysis, research on chain logic (...) delivers a promising idea of chain models and a new definition of satisfiability, particularly for quantifier expressions. Our paper gives a framework for Lindström-type characterizability of predicate logic systems interpreted semantically in models with objects based on measures (analytic structures). In particular, Hájek’s logic of integrals (HLI) is redefined as an abstract logic with a new type of Hájek’s satisfiability and constitutes a maximal logic in the class of logic systems for describing analytic structures with Lebesgue integrals and satisfying compactness, elementary chain condition, and weak negation. (shrink)