This note is based on a lecture delivered at the Conference on the Scien- tic Research of the Mathematical Center of Opole, Turawa, May 10-11th, 1980. A somewhat extended version will be published in the Proceedings of the Conference. At the same time it is an abstract of a part of a planned larger paper, which will involve the theory of label-tokens. The theory is included into the author's monograph in Polish "Teorie Językow Syntaktycznie Kategorialnych", PWN, Warszawa-Wrocław 1985 (...) and into its English version: Theory of Language Syntax. Categorial Approach, Kluwer Academic Publishers, Boston-London-Dordrecht 1991. (shrink)

The paper contains an overview of the most important results presented in the monograph of the author "Teorie Językow Syntaktycznie-Kategorialnych" ("Theories of Syntactically-Categorial Languages" (in Polish), PWN, Warszawa-Wrocław 1985. In the monograph four axiomatic systems of syntactically-categorial languages are presented. The first two refer to languages of expression-tokens. The others also takes into consideration languages of expression-types. Generally, syntactically-categorial languages are languages built in accordance with principles of the theory of syntactic categories introduced by S. Leśniewski [1929,1930]; they (...) are connected with- the Ajdukiewicz’s work [1935] which was a continuation of Leśniewski’s idea and further developed and popularized in the research on categorial grammars, by Y. Bar-Hillel [1950,1953,1964]. To assign a suitable syntactic category to each word of the vocabulary is the main idea of syntactically-categorial approach to language. Compound expressions are built from the words of the vocabulary and then a suitable syntactic-category is assigned to each of them. A language built in this way should be decidable, which means that there should exist an algorithm for deciding about each expression of it, whether it is well-formed or is syntactically connected . The traditional, originating from Husserl, understanding of the syntactic category confronts some difficulties. This notion is defined by abstraction using the concept of affiliation of two expressions to the same syntactic category. (shrink)

The two-fold ontological character of linguistic objects revealed due to the distinction between “type” and “token” introduced by Ch. S. Peirce can be a base of the two-fold, both theoretical and axiomatic, approach to the language. Referring to some ideas included in A. A. Markov’s work [1954] (in Russian) on Theory of Algorithms and in some earlier papers of the author, the problem of formalization of the concrete and abstract words theories raised by J. Słupecki was solved. (...) The construction of the theories presented here has two levels. The axiomatic theory of label-tokens: material, physical linguistic objects, constitutes the first one. Label-types, according to the literature of the subject, are defined on the other level as equivalence classes of equiform label-tokens. Assuming the opposite point of view, one can accept that theory of label-types: abstract labels, formalized on the first level, in which it is possible to define the notion of label-token as well as the derivative notions on the second level, should become the basis of formalization of the theory of linguistic expressions and the theory of language in general. The axioms and definitions of both theories of labels: T k and T p representing the other approach to the ontology of language are included in the sequel of the abstract. The foundations of the theory of labels T k in which the primary assumption as to the label-types existence is superfluous have been referred on the basis of the author's monography "Teorie Języków Syntaktycznie Kategorialnych" ( "The Theories of Syntactically Categorial Languages"), PWN, Warszawa-Wrocław 1985. The basis of the theory of labels T p which takes into account the other position has to be presented here for the first time. Some extended ideas of the paper will also be presented in author's paper "Logiczne podstawy ontologii składni Języka" ("Logical foundations of language syntax ontology), Studia Filozoficzne 6-7 (271-272), (1988), pp. 263-284. (shrink)

The book is a collection of papers and aims to unify the questions of syntax and semantics of language, which are included in logic, philosophy and ontology of language. The leading motif of the presented selection of works is the differentiation between linguistic tokens (material, concrete objects) and linguistic types (ideal, abstract objects) following two philosophical trends: nominalism (concretism) and Platonizing version of realism. The opening article under the title “The Dual Ontological Nature of Language Signs and (...) the Problem of Their Mutual Relations” provides a broad introduction into the problem area connected with this differentiation, while the logic-formal characteristics of the distinction are framed in the work entitled “On the Type-Token Relationships” (Chapter 1). The basic part of the book deals with issues relating to syntax (Chapters 2-4) and semantics of language (Chapters 5-6), as well as pertaining to syntactic-semantic pragmatic questions (Chapters 7-13). Throughout the book, language, categorial language, is characterized syntactically as generated by classical categorial grammar (Chapter 2) and formalized on two opposing levels: as language of expression-tokens (level of tokens) and language of expression-types (level of types). The author’s considerations contained in Chapters 2 and 4 lead to the important philosophical conclusion that in formal-logical syntactic studies on language the assumption that expression-types constitute the primary language layer while expression-tokens make the secondary one, can be neglected; thus, this speaks in favour of the opposing standpoint—the concretistic one—in the ontology of language syntax. In the works “Meaning and Interpretations”, Parts I and II (Chapters 5 and 6), it is underlined, however, that such semantic concepts as: meaning, denotation and interpretation are defined on the types level, yet their formal definitions require making use of notions of the tokens level. The semantic notions introduced in the above-mentioned articles are also used in the following works of the present selection, under the titles: “Three Principles of Compositionality” and “On Metaknowledge and Truth” (Chapters 7 and 8). They formalize two principles of compositionality that are well known in the literature on the subject, deriving from Frege, i.e. those of meaning and of denotation; they are related to the syntactic principle of compositionality which was introduced by the author. All the three principles are, at the same time, three conditions of homomorphism of categorial language algebra into three kinds of non-standard models of language (one syntactic and two semantic ones: intensional and extensional), which allows introducing three definitions of truthfulness into these models. The next two works in the collection, entitled: “On Language Adequacy” and “What is the Sense in Logic and Philosophy of Language” (Chapters 9 and 10) concern adequacy of categorial language syntax along with its dual semantics: intensional and extensional, and categorial compatibility of any of its syntactic categories with two corresponding semantic categories: intensional and extensional, based on the compatibility the syntactic category of each language expression with the ontological category assigned to its denotatum. The well-known problem of categorial compatibility for first-order quantifiers finds its solution in the paper “Categories of First-Order Quantifiers” (Chapter 11). In the work “Logic and Ontology of Language” (Chapter 12), being in a sense a summary of the considerations presented in the preceding chapters of the book, language is treated as an ontological being, characterized in compliance with the logical conception of language proposed by Ajdukiewicz. Application—like throughout the book—of tools of classical logic and set theory has resulted in emergence of a general formal logical theory of syntax, semantics and pragmatics of language, which takes into account duality in the understanding of linguistic expressions as tokens (concretes) and types (abstract objects). In terms that take into account a functional approach to language itself, there comes out an ontological neutrality of logic with respect to existential assumptions relating to the ontological nature of linguistic expressions and their extra-linguistic ontological counterparts. The issues connected with applying logic while explaining the manner of using linguistic tokens and linguistic types to determine notions of language communication are raised and illustrated in the last chapter of the work, bearing the title “A Logical Conceptualization of Knowledge on the Notion of Language Communication”. (shrink)

The main purpose of the paper is to outline the formal-logical, general theory of language treated as a particular ontological being. The theory itself is called the ontology of language, because it is motivated by the fact that the language plays a special role: it reflects ontology and ontology reflects the world. Language expressions are considered to have a dual ontological status. They are understood as either concretes, that is tokens – material, physical (...) objects, or types – classes of tokens, which are abstract objects. Such a duality is taken into account in the presented logical theory of syntax, semantics and pragmatics. We point to the possibility of building it on two different levels; one which stems from concretes, language tokens of expressions, whereas the other one – from their classes, types conceived as abstract, ideal beings. The aim of this work is not only to outline this theory as taking into account the functional approach to language, with respect to the dual ontological nature of its expressions, but also to show that the logic based on it is ontologically neutral in the sense that it abstracts from accepting some existential assumptions, related with the ontological nature of these linguistic expressions and their extra-linguistic ontological counterparts (objects). (shrink)

The main objective of the paper is to provide a conceptual apparatus of a general logical theory of language communication. The aim of the paper is to outline a formal-logical theory of language in which the concepts of the phenomenon of language communication and language communication in general are defined and some conditions for their adequacy are formulated. The theory explicates the key notions of contemporary syntax, semantics, and pragmatics. The theory (...) is formalized on two levels: token-level and type-level. As such, it takes into account the dual – token and type – ontological character of linguistic entities. The basic notions of the theory: language communication, meaning and interpretation are introduced on the second, type-level of formalization, and their required prior formalization of some of the notions introduced on the first, token-level; among others, the notion of an act of communication. Owing to the theory, it is possible to address the problems of adequacy of both empirical acts of communication and of language communication in general. All the conditions of adequacy of communication discussed in the presented paper, are valid for one-way communication (sender-recipient); nevertheless, they can also apply to the reverse direction of language communication (recipient-sender). Therefore, they concern the problem of two-way understanding in language communication. (shrink)

The aim of this study is to discuss in what sense one can speak about universal character of logic. The authors argue that the role of logic stands mainly in the generality of its language and its unrestricted applications to any field of knowledge and normal human life. The authors try to precise that universality of logic tends in: (a) general character of inference rules and the possibility of using those rules as a tool of justification of theorems of (...) every science, (b) principles of correct formulating of thoughts and using language, and (c) general deductive method of reasoning, i.e in the study of language syntax and semantics. The authors present two theories of language syntax and semantics as exemplifications based on the Tarski’s famous results in metalogic: (1) a formalization of universal syntax system by Andrzej Grzegorczyk based on a new primitive notion of quotation-marks operator, and (2) an enlarged system of axiomatic theory of syntax of any categorial language of Urszula Wybraniec-Skardowska’s in which the main role plays the relation of concatenation understood as a set-theoretical function. The study concludes in arguing that the importance of the result (2) lies not only in solving some philosophical problems but also in different fields of knowledge and spheres of human life as ex. in discussion and education as well. (shrink)

The paper is an attempt at a logical explication of some crucial notions of current general semantics and pragmatics. A general, axiomatic, formal-logical theory of meaning and interpretation is outlined in this paper.In the theory, accordingto the token-type distinction of Peirce, language is formalised on two levels: first as a language of token-objects (understood as material, empirical, enduring through time-and space objects) and then – as a language of type-objects (understood as abstract objects, (...) as classes of tokens). The basic concepts of the theory, i.e. the notions: meaning, denotation and interpretation of well-formed expressions (wfes) of the language are formalised on the type-level, by utilising some semantic-pragmatic primitive notions introduced on the token-level. The paper is divided into two parts.In Part Ia theoryof meaningand denotation is proposed, and in Part II - its expansion to the theory of meaning and interpretation is presented.The meaninga wfe is defined as an equivalence class of the relation possessing the same manner of using types (cf. Ajdukiewicz [1934], Wittgenstein [1953]). The concept of denotation is defined by means of the relation of referring which holds between wfe-types and objects of reality described by the given language. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of (...) language is often paired with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results (...) hold for several systems of the hierarchy of paraconsistent logics known as Logics of Formal Inconsistency (LFIs). Because of this, these logics are uniquely characterized by semantics of non-deterministic kind. This paper offers a solution for two open problems in the domain of paraconsistency, in particular connected to algebraization of LFIs, by obtaining several LFIs weaker than C1, each of one is algebraizable in the standard Lindenbaum-Tarski's sense by a suitable variety of Boolean algebras extended with operators. This means that such LFIs satisfy the replacement property. The weakest LFI satisfying replacement presented here is called RmbC, which is obtained from the basic LFI called mbC. Some axiomatic extensions of RmbC are also studied, and in addition a neighborhood semantics is defined for such systems. It is shown that RmbC can be defined within the minimal bimodal non-normal logic E+E defined by the fusion of the non-normal modal logic E with itself. Finally, the framework is extended to first-order languages. RQmbC, the quantified extension of RmbC, is shown to be sound and complete w.r.t. BALFI semantics. (shrink)

This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical (...) first-order predicate calculus with a view to computational implementations, namely in automated theorem proving and logic programming. The present third edition improves on the previous ones by providing an altogether more algorithmic approach: There is now a wholly new section on algorithms and there are in total fourteen clearly isolated algorithms designed in pseudo-code. Other improvements are, for instance, an emphasis on functions in Chapter 1 and more exercises with Turing machines. (shrink)

Gravitation is interpreted to be an “ontomathematical” force or interaction rather than an only physical one. That approach restores Newton’s original design of universal gravitation in the framework of “The Mathematical Principles of Natural Philosophy”, which allows for Einstein’s special and general relativity to be also reinterpreted ontomathematically. The entanglement theory of quantum gravitation is inherently involved also ontomathematically by virtue of the consideration of the qubit Hilbert space after entanglement as the Fourier counterpart of pseudo-Riemannian space. Gravitation can (...) be also interpreted as purely mathematical or logical “force” or “interaction” as a corollary from its ontomathematical (rather than physical) realization. The ontomathematical approach to gravitation is implicit in general relativity equating it to operators in pseudo-Riemannian space obeying the Einstein field equation and also well-known by the “geometrization of physics”. Quantum mechanics shares the same by the separable complex Hilbert space and defining “physical quantity” by the Hermitian operators on it. One can interpret special Minkowski space involved by special relativity and the qubit Hilbert space of quantum information as Fourier counterparts immediately noticing that general relativity means gravitation as the Fourier counterpart of non-Hermitian operators implying non-unitarity and the violation of energy conservation and thus destroying Pauli’s particle paradigm. Since the Standard model obeys it, this explains the impossibility of “quantum gravitation” in any framework conservatively generalizing the Standard model so that it would include gravitation along with electromagnetic, weak, and strong interactions. Einstein’s geometrization of gravitation can be continued into a purely mathematical theory of it following Euclid’s realization for geometry to be exhaustively built in a deductive and axiomatic way as well as Riemann’s parametrization of all the class of Euclidean and non-Euclidean geometries by “space curvature”, then being generalized to Minkowski space as the operators on pseudo-Riemannian space as the Einstein field equation means gravitation. The transition from mathematical gravitation to logical one can rely on the historical lesson of the pair of Lobachevski’s and Riemann’s approaches now “reversely”, i.e., from the latter to the former. Logical gravitation is linkable to Hegel’s dialectical logic and ontological dialectics abandoning their interpretations as a new zero logic substituting classical propionyl logic. The approach of ontomathematics generalizing that of ontology, traceable even to Aristotle’s reformation of Plato’s doctrine, needs Hegel’s doctrine to be formalized as a first-order logic naturally containing Boolean algebra, isomorphic to both classical propositional logic and set theory being the class of all first-order logics, as a sub-logic along with Peano arithmetic as another sub-logic. The first-order logic at issue is called Hilbert arithmetic and elaborated in detail in other papers. It allows for both self-foundation of mathematics to be internally proved as complete and furthermore, quantum mechanics reinterpreted as quantum information to be included by the qubit Hilbert space interpretable in turn as a dual and physical counterpart of Hilbert arithmetic in a narrow sense, that is, both counterparts constitute Hilbert arithmetic in a wide sense, being mathematical and physical simultaneously and thus overcoming the Cartesian dualism of “body” gapped from “mind” by an abyss. Then, the proper philosophical interpretation of gravitation to be the fundamental ontomathematical force or interaction overcomes the ridiculous belief of the Big Bang wrongly alleged to be a scientific theory. Ontomathematical gravitation suggests an omnipresent and omnitemporal medium of “God’s” creation “ex nihilo” following only the natural necessity of quantum-information conservation particularly and locally manifested as energy conservation. (shrink)

The paper concentrates on the problem of adequate reflection of fragments of reality via expressions of language and inter-subjective knowledge about these fragments, called here, in brief, language adequacy. This problem is formulated in several aspects, the most being: the compatibility of language syntax with its bi-level semantics: intensional and extensional. In this paper, various aspects of language adequacy find their logical explication on the ground of the formal-logical theory T of any categorial (...) class='Hi'>language L generated by the so-called classical categorial grammar, and also on the ground of its extension to the bi-level, intensional and extensional semantic-pragmatic theory ST for L. In T, according to the token-type distinction of Ch.S. Peirce, L is characterized first as a language of well-formed expression-tokens (wfe-tokens) - material, concrete objects - and then as a language of wfe-types - abstract objects, classes of wfe-tokens. In ST the semantic-pragmatic notions of meaning and interpretation for wfe-types of L of intensional semantics and the notion of denotation of extensional semanics for wfe-types and constituents of knowledge are formalized. These notions allow formulating a postulate (an axiom of categorial adequacy) from which follow all the most important conditions of the language adequacy, including the above, and a structural one connected with three principles of compositionality. (shrink)

Some philosophers argue that a theory of logical validity should not interpret its own language, because a Russellian argument shows that self-applicability is inconsistent with the ability to capture all the interpretations of its own language. First, I set up a formal system to examine the Russellian argument. I then defend the need for self-applicability. I argue that self-applicability seems to be implied by generality, and that the Russellian argument rests on a test for meaning that (...) is biased against self-applicability. I propose an alternative test which is unproblematic for self-applicability. I conclude that self-applicability can be vindicated and the Russellian argument can be resisted. (shrink)

Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that for a logical (...) constant to exist, its rules must be conservative over a previously given consequence relation and guarantee the uniqueness of the constant. The twist is that we require logical vocabulary to be provably conservative, not over a previously given formal consequence relation, but over a previously given meaningful vocabulary of a language. Uniqueness is also a feature defined in terms of provability: if two syntactically distinguished expressions are governed by the same rules, then formulas with them as main operators are interderivable. Belnap’s criteria are not only those for the existence of a logical constant, but more: they are what distinguishes logical vocabulary from all other expressions. It is the defining mark of a logical constant that it is provably conservative over the fragment of the language which excludes it and that its rules guarantee its uniqueness. The third component is the topic neutrality of logic. The provable conservativeness of logic over a previously given vocabulary of a language is motivated, in part, by appeal to molecularism in the theory of meaning. Molecularity is a feature endorsed by the theory of meaning as a whole, so it does not distinguish logical constants from other expressions. The same is true for conservativeness. We argue that molecularity, and hence conservativeness, are implicit presuppositions of speakers’ use of language: the addition of new vocabulary to a language is presupposed to be conservative. But this presupposition is one that we should be able reflectively to endorse (such as when attempting a rational reconstruction of the use of the vocabulary). Thus, where conservativeness is found to fail, this defect should be remedied and the use of the vocabulary corrected (as in classical negation) or excised altogether (as in pejoratives). We go on to characterise a notion of topic neutrality, which we argue applies to logical vocabulary. We then note that reflective endorsement of the conservativeness of a topic neutral vocabulary requires a proof that the vocabulary is conservative relative to any base vocabulary. Thus we require that logical vocabulary be demonstrably conservative. Allying this requirement, distinctive of logic, to a general consideration about the commitments of assertion yields a mode of justification for logical constants akin to some conceptions of Harmony, i.e., to the idea that the consequences of assertion of a logical complex need to be warranted by the grounds and ought to be the strongest consequences warranted by the grounds. Intuitionistic logic acquires a somewhat familiar justification but emanating from a new motivation. (shrink)

ABSTRACT: An introduction to Stoic logic. Stoic logic can in many respects be regarded as a fore-runner of modern propositional logic. I discuss: 1. the Stoic notion of sayables or meanings (lekta); the Stoic assertibles (axiomata) and their similarities and differences to modern propositions; the time-dependency of their truth; 2.-3. assertibles with demonstratives and quantified assertibles and their truth-conditions; truth-functionality of negations and conjunctions; non-truth-functionality of disjunctions and conditionals; language regimentation and ‘bracketing’ devices; Stoic basic principles of propositional logic; (...) 4. Stoic modal logic; 5. Stoic theory of arguments: two premisses requirement; validity and soundness; 6. Stoic syllogistic or theory of formally valid arguments: a reconstruction of the Stoic deductive system, which consisted of accounts of five types of indemonstrable syllogisms, which function as nullary argumental rules that identify indemonstrables or axioms of the system, and four deductive rules (themata) by which certain complex arguments can be reduced to indemonstrables and thus shown to be formally valid themselves; 7. arguments that were considered as non-syllogistically valid (subsyllogistic and unmethodically concluding arguments). Their validity was explained by recourse to formally valid arguments. (shrink)

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

The theories of belief change developed within the AGM-tradition are not logics in the proper sense, but rather informal axiomatic theories of belief change. Instead of characterizing the models of belief and belief change in a formalized object language, the AGM-approach uses a natural language — ordinary mathematical English — to characterize the mathematical structures that are under study. Recently, however, various authors such as Johan van Benthem and Maarten de Rijke have suggested representing doxastic change within (...) a formal logical language: a dynamic modal logic. Inspired by these suggestions Krister Segerberg has developed a very general logical framework for reasoning about doxastic change: dynamic doxastic logic (DDL). This framework may be seen as an extension of standard Hintikka-style doxastic logic with dynamic operators representing various kinds of transformations of the agent's doxastic state. Basic DDL describes an agent that has opinions about the external world and an ability to change these opinions in the light of new information. Such an agent is non-introspective in the sense that he lacks opinions about his own belief states. Here we are going to discuss various possibilities for developing a dynamic doxastic logic for introspective agents: full DDL or DDL unlimited. The project of constructing such a logic is faced with difficulties due to the fact that the agent’s own doxastic state now becomes a part of the reality that he is trying to explore: when an introspective agent learns more about the world, then the reality he holds beliefs about undergoes a change. But then his introspective (higher-order) beliefs have to be adjusted accordingly. In the paper we shall consider various ways of solving this problem. (shrink)

The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is approximated by Herbrand’s (...) Induction-Axiom Schema [23]. Similarly, in first-order set theory, Zermelo’s second-order Separation Axiom is approximated by Fraenkel’s first-order Separation Schema [17]. In some of several closely related senses, a schema is a complex system having multiple components one of which is a template-text or scheme-template, a syntactic string composed of one or more “blanks” and also possibly significant words and/or symbols. In accordance with a side condition the template-text of a schema is used as a “template” to specify a multitude, often infinite, of linguistic expressions such as phrases, sentences, or argument-texts, called instances of the schema. The side condition is a second component. The collection of instances may but need not be regarded as a third component. The instances are almost always considered to come from a previously identified language (whether formal or natural), which is often considered to be another component. This article reviews the often-conflicting uses of the expressions ‘schema’ and ‘scheme’ in the literature of logic. It discusses the different definitions presupposed by those uses. And it examines the ontological and epistemic presuppositions circumvented or mooted by the use of schemata, as well as the ontological and epistemic presuppositions engendered by their use. In short, this paper is an introduction to the history and philosophy of schemata. (shrink)

Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper "Ein (...) Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie"; online available at http://philpapers.org/rec/CORERE.). (shrink)

The objective of this research programme is to contribute to the establishment of the emerging science of Formal Ontology in Information Systems via a collaborative project involving researchers from a range of disciplines including philosophy, logic, computer science, linguistics, and the medical sciences. The re­searchers will work together on the construction of a unified formal ontology, which means: a general framework for the construction of ontological theories in specific domains. The framework will be constructed using the axiomatic- (...) class='Hi'>deductive method of modern formal ontology. It will be tested via a series of applications relating to on-going work in Leipzig on medical taxonomies and data dictionaries in the context of clinical trials. This will lead to the production of a domain-specific ontology which is designed to serve as a basis for applications in the medical field. (shrink)

The monograph contains three works on research on the concept of a rejected sentence. This research, conducted under the supervision of Prof. Jerzy Słupecki by U. Wybraniec-Skardowska (1) "Theory of rejected sentences" and G. Bryll (2) "Some supplements of theory of rejected sentences" and (3) "Logical relations between sentences of empirical sciences" led to the construction of a theory rejected sentences and made it possible to formalize certain issues in the methodology of empirical sciences. The concept of (...) a rejected sentence was introduced by J. Łukasiewicz in the course of his inquiry into Aristotelian Syllogistic. It was essentialy generelized by J. Słupecki who, with reference to Tarski's axiomatic theory of deductive systems (1930), gave the formal definition of the rejection function Cn' according to which a sentence y is rejected on the base of a set of sentences X iff at least one sentence which belongs to X can be deduced from the sentence y. Słupecki proved (1959) that the function Cn', which assignes to the set X the set of sentences rejected on the basis of X, is additive and satisfies the axioms of Tarski's general theory of deductive systems. Work (1) uses not only Tarski's general theory of systems but also his the so-called enlarged theory of systems (1930). It constructs a theory T of rejected sentences (propositions), which is created from Tarski's richer theory of systems by adding one axiom and a number of definitions; among them the definition of the rejection function Cn' is fundamental one. Cn' is a function which assignes to every set X of false sentences the set Cn'X whose members are exclusively false senteces. A number of theorems which describes properties of defined concepts have been proved in T. Some of them are necessary for conducting considertions of the concluding section of (1) devoted to the empirical sentences. Section 2 of (1) deals with the theory of the unit consequenses. It is characterized by an axiom from which follow all axioms of Tarski's general theory of deductive systems, additivity and the property that the unit consequence of the set X of sentences is a unit consequence only one sentence of X. An example of unit consequence is the rejection consequence Cn'. In section 3 of (1) the dual theory T' equivalent to T is presented. In T' the primitive concept is the rejection function Cn'. The fundamental axiom of T' states that Cn' is a unit consequence. The concluding section brings a few examples of applications of the definitions and theorems of T in the domain of the scientific methodology. Work (2) corresonds to J. Słupecki paper (1959) and the theory T of rejected propositions given in work (1). In this paper some suplements of the theory T are given. Work (3) is an extension of the theory of rejected propositios given in the paper (1). It is an attempt of formalization some problems of methodology of the empirical sciences which concern to such concepts as: empirical sentence, similar sentence, generalization, inductive conclusion etc. (shrink)

In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of the (...) system is deducible by means of a formal deduction in the system. Review of the system makes the first point obvious. The purpose of the present article is to prove the second. Strong completeness is demonstrated for the Aristotelian system. (shrink)

Formal ontologies are nowadays widely considered a standard tool for knowledge representation and reasoning in the Semantic Web. In this context, they are expected to play an important role in helping automated processes to access information. Namely: they are expected to provide a formal structure able to explicate the relationships between different concepts/terms, thus allowing intelligent agents to interpret, correctly, the semantics of the web resources improving the performances of the search technologies. Here we take into account a (...) problem regarding Knowledge Representation in general, and ontology based representations in particular; namely: the fact that knowledge modeling seems to be constrained between conflicting requirements, such as compositionality, on the one hand and the need to represent prototypical information on the other. In particular, most common sense concepts seem not to be captured by the stringent semantics expressed by such formalisms as, for example, Description Logics (which are the formalisms on which the ontology languages have been built). The aim of this work is to analyse this problem, suggesting a possible solution suitable for formal ontologies and semantic web representations. The questions guiding this research, in fact, have been: is it possible to provide a formal representational framework which, for the same concept, combines both the classical modelling view (accounting for compositional information) and defeasible, prototypical knowledge ? Is it possible to propose a modelling architecture able to provide different type of reasoning (e.g. classical deductive reasoning for the compositional component and a non monotonic reasoning for the prototypical one)? We suggest a possible answer to these questions proposing a modelling framework able to represent, within the semantic web languages, a multilevel representation of conceptual information, integrating both classical and non classical (typicality based) information. Within this framework we hypothesise, at least in principle, the coexistence of multiple reasoning processes involving the different levels of representation. (shrink)

As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...) many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. -/- For my money, Gentzen’s natural deduction and Church’s lambda calculus are on a par with Einstein’s relativity and Dirac’s quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I’ll need a few symbols, but not too many, and I’ll explain as I go along. -/- To simplify, I’ll present the story as we understand it now, with some asides to fill in the history. First, I’ll introduce Gentzen’s natural deduction, a formalism for proofs. Next, I’ll introduce Church’s lambda calculus, a formalism for programs. Then I’ll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. Finally, I’ll conclude with a look at how these principles are being applied to design a new generation of programming languages, particularly mobile code for the Internet. (shrink)

This is a review of From Discourse to Logic: Introduction to Modeltheoretic Semantics of Natural Language, Formal Logic and Discourse Representation Theory, written by Hans Kamp and Uwe Reyle and published by Kluwer Academic Publishers in 1993.

In this paper, partly historical and partly theoretical, after having shortly outlined the development of the meta-ethics in the 1900?s starting from the Tractatus of Wittgenstein, I argue it is possible to sustain that emotivism and intuitionism are unsatisfactory ethical conceptions, while on the contrary, reason (intended in a logical-deductive sense) plays an effective role both in ethical discussions and in choices. There are some characteristics of the ethical language (prescriptivity, universalizability and predominance) that cannot be eluded (pain (...) the non significativity of the same language) by those who want to morally reason, i.e. by those who intend to regulate their own behaviour on the basis of knowledged and coherent principles. These characteristics can be found whether or not all possible ontological-metaphysics foundations of morals are taken into account. Furthermore the deontic logic systems allow the formalization of ethical theories and - at least in principle - a rigorous critical discussion of the same, but obviously nothing can be affirmed on the value of truth of the axioms of a system. In the deontic logic systems Hume?s law is assumed as an implicit result of inferential (conventional) rules and the acceptance of Hume?s law as a logical-linguistic thesis does not involve the cancellation of values (nihilism) or ethical relativism or indifferentism. (shrink)

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. (...) These practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC. (shrink)

A Fortiori Logic: Innovations, History and Assessments is a wide-ranging and in-depth study of a fortiori reasoning, comprising a great many new theoretical insights into such argument, a history of its use and discussion from antiquity to the present day, and critical analyses of the main attempts at its elucidation. Its purpose is nothing less than to lay the foundations for a new branch of logic and greatly develop it; and thus to once and for all dispel the many fallacious (...) ideas circulating regarding the nature of a fortiori reasoning. -/- The work is divided into three parts. The first part, Formalities, presents the author’s largely original theory of a fortiori argument, in all its forms and varieties. Its four (or eight) principal moods are analyzed in great detail and formally validated, and secondary moods are derived from them. A crescendo argument is distinguished from purely a fortiori argument, and similarly analyzed and validated. These argument forms are clearly distinguished from the pro rata and analogical forms of argument. Moreover, we examine the wide range of a fortiori argument; the possibilities of quantifying it; the formal interrelationships of its various moods; and their relationships to syllogistic and analogical reasoning. Although a fortiori argument is shown to be deductive, inductive forms of it are acknowledged and explained. Although a fortiori argument is essentially ontical in character, more specifically logical-epistemic and ethical-legal variants of it are acknowledged. -/- The second part of the work, Ancient and Medieval History, looks into use and discussion of a fortiori argument in Greece and Rome, in the Talmud, among post-Talmudic rabbis, and in Christian, Moslem, Chinese and Indian sources. Aristotle’s approach to a fortiori argument is described and evaluated. There is a thorough analysis of the Mishnaic qal vachomer argument, and a reassessment of the dayo principle relating to it, as well as of the Gemara’s later take on these topics. The valuable contribution, much later, by Moshe Chaim Luzzatto is duly acknowledged. Lists are drawn up of the use of a fortiori argument in the Jewish Bible, the Mishna, the works of Plato and Aristotle, the Christian Bible and the Koran; and the specific moods used are identified. Moreover, there is a pilot study of the use of a fortiori argument in the Gemara, with reference to Rodkinson’s partial edition of the Babylonian Talmud, setting detailed methodological guidelines for a fuller study. There is also a novel, detailed study of logic in general in the Torah. -/- The third part of the present work, Modern and Contemporary Authors, describes and evaluates the work of numerous (some thirty) recent contributors to a fortiori logic, as well as the articles on the subject in certain lexicons. Here, we discover that whereas a few authors in the last century or so made some significant contributions to the field, most of them shot woefully off-target in various ways. The work of each author, whether famous or unknown, is examined in detail in a dedicated chapter, or at least in a section; and his ideas on the subject are carefully weighed. The variety of theories that have been proposed is impressive, and stands witness to the complexity and elusiveness of the subject, and to the crying need for the present critical and integrative study. But whatever the intrinsic value of each work, it must be realized that even errors and lacunae are interesting because they teach us how not to proceed. -/- This book also contains, in a final appendix, some valuable contributions to general logic, including new analyses of symbolization and axiomatization, existential import, the tetralemma, the Liar paradox and the Russell paradox. (shrink)

This paper discusses the theoretical assumptions behind the conception of the logic of faith and deed (LF&D) and outlines its formal-axiomatic frame and its method of construction, which enable us to understand it as a kind of deductive science. The paper is divided into several sections, starting with the logical analysis of the ambiguous terms of 'faith’ and 'action', and focusing in particular on the concepts of religious faith and deed as a type of conscious activity relating (...) to a matter or matters of social importance. After outlining the main ideas and basic assumptions of the theoretical conception of the LF&D as an axiomatic theory, the author introduces some axiom systems for: 1) the logics of faith LF (doxastic logics), 2) the logic of deed LD, and 3) certain logics of norms DL (deontic logics) connected with "duties" and concerning actions/deeds. Lastly, the paper outlines the scientific LF&D based on the three types of logic 1)-3). (shrink)

This article informally presents a solution to the paradoxes of truth and shows how the solution solves classical paradoxes (such as the original Liar) as well as the paradoxes that were invented as counterarguments for various proposed solutions (“the revenge of the Liar”). This solution complements the classical procedure of determining the truth values of sentences by its own failure and, when the procedure fails, through an appropriate semantic shift allows us to express the failure in a classical two-valued (...) class='Hi'>language. Formally speaking, the solution is a language with one meaning of symbols and two valuations of the truth values of sentences. The primary valuation is a classical valuation that is partial in the presence of the truth predicate. It enables us to determine the classical truth value of a sentence or leads to the failure of that determination. The language with the primary valuation is precisely the largest intrinsic fixed point of the strong Kleene three-valued semantics (LIFPSK3). The semantic shift that allows us to express the failure of the primary valuation is precisely the classical closure of LIFPSK3: it extends LIFPSK3 to a classical language in parts where LIFPSK3 is undetermined. Thus, this article provides an argumentation, which has not been present in contemporary debates so far, for the choice of LIFPSK3 and its classical closure as the right model for the truth predicate. In the end, an erroneous critique of Kripke-Feferman axiomatic theory of truth, which is present in contemporary literature, is pointed out. (shrink)

By logical foundations of language syntax ontology we understand here the construction of formalized linguistic theories based on widely conceived mathematical logic and dependent on two trends in language ontology. The formalization includes exclusively the syntactic aspect of logical analysis of language characterized categorially according to Ajdukiewicz's approach [1935, 1960]. Any categorial language L is characterized formally on two levels: on one of them it concerns the language of expression-tokens, on the other one - that (...) of expression-types. Accepting the view that expression-concretes, that is expression-tokens - thus, physical objects are fundamental language layer, whereas the secondary layer for L are expression-abstracts, that is expression-types - thus, ideal objects, it is the nominalistic, concretistic philosophical view on the ontological nature of language entities that is adhered to. Supporting the view that expression-types are the basic language layer, while expression-concretes are the secondary one, we take the opposite standpoint - platonizing one. We prove that the two dual approaches towards the two-level syntax theory of language are logically eqivalent. In the scope of language syntax, both conceptions deriving from two different existential assumption are equivalent. This statement is philosophical significance, since it proves that in syntactical studies on language the assumption of the existence of abstract language beings (interpreted as classes equiform tokens) can be neglected. The idea was signalized by author in ealier paper "On the type-token relationships'' [1986) and than, in a slighly diffrent form in English "On the eliminatibility of ideal linguistic entities, Studia Logica 48,no 4 (1989), pp. 587-615. (shrink)

An introduction to sentential logic and first-order predicate logic with identity, logical systems that significantly influenced twentieth-century analytic philosophy. After working through the material in this book, a student should be able to understand most quantified expressions that arise in their philosophical reading. -/- This books treats symbolization, formal semantics, and proof theory for each language. The discussion of formal semantics is more direct than in many introductory texts. Although forall x does not contain proofs of (...) soundness and completeness, it lays the groundwork for understanding why these are things that need to be proven. -/- The book highlights the choices involved in developing sentential and predicate logic. Students should realize that these two are not the only possible formal languages. In translating to a formal language, we simplify and profit in clarity. The simplification comes at a cost, and different formal languages are suited to translating different parts of natural language. (shrink)

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 types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

The Logic of Causation: Definition, Induction and Deduction of Deterministic Causality is a treatise of formal logic and of aetiology. It is an original and wide-ranging investigation of the definition of causation (deterministic causality) in all its forms, and of the deduction and induction of such forms. The work was carried out in three phases over a dozen years (1998-2010), each phase introducing more sophisticated methods than the previous to solve outstanding problems. This study was intended as part of (...) a larger work on causal logic, which additionally treats volition and allied cause-effect relations (2004). The Logic of Causation deals with the main technicalities relating to reasoning about causation. Once all the deductive characteristics of causation in all its forms have been treated, and we have gained an understanding as to how it is induced, we are able to discuss more intelligently its epistemological and ontological status. In this context, past theories of causation are reviewed and evaluated (although some of the issues involved here can only be fully dealt with in a larger perspective, taking volition and other aspects of causality into consideration, as done in Volition and Allied Causal Concepts). Phase I: Macroanalysis. Starting with the paradigm of causation, its most obvious and strongest form, we can by abstraction of its defining components distinguish four genera of causation, or generic determinations, namely: complete, partial, necessary and contingent causation. When these genera and their negations are combined together in every which way, and tested for consistency, it is found that only four species of causation, or specific determinations, remain conceivable. The concept of causation thus gives rise to a number of positive and negative propositional forms, which can be studied in detail with relative ease because they are compounds of conjunctive and conditional propositions whose properties are already well known to logicians. The logical relations (oppositions) between the various determinations (and their negations) are investigated, as well as their respective implications (eductions). Thereafter, their interactions (in syllogistic reasoning) are treated in the most rigorous manner. The main question we try to answer here is: is (or when is) the cause of a cause of something itself a cause of that thing, and if so to what degree? The figures and moods of positive causative syllogism are listed exhaustively; and the resulting arguments validated or invalidated, as the case may be. In this context, a general and sure method of evaluation called ‘matricial analysis’ (macroanalysis) is introduced. Because this (initial) method is cumbersome, it is used as little as possible – the remaining cases being evaluated by means of reduction. Phase II: Microanalysis. Seeing various difficulties encountered in the first phase, and the fact that some issues were left unresolved in it, a more precise method is developed in the second phase, capable of systematically answering most outstanding questions. This improved matricial analysis (microanalysis) is based on tabular prediction of all logically conceivable combinations and permutations of conjunctions between two or more items and their negations (grand matrices). Each such possible combination is called a ‘modus’ and is assigned a permanent number within the framework concerned (for 2, 3, or more items). This allows us to identify each distinct (causative or other, positive or negative) propositional form with a number of alternative moduses. This technique greatly facilitates all work with causative and related forms, allowing us to systematically consider their eductions, oppositions, and syllogistic combinations. In fact, it constitutes a most radical approach not only to causative propositions and their derivatives, but perhaps more importantly to their constituent conditional propositions. Moreover, it is not limited to logical conditioning and causation, but is equally applicable to other modes of modality, including extensional, natural, temporal and spatial conditioning and causation. From the results obtained, we are able to settle with formal certainty most of the historically controversial issues relating to causation. Phase III: Software Assisted Analysis. The approach in the second phase was very ‘manual’ and time consuming; the third phase is intended to ‘mechanize’ much of the work involved by means of spreadsheets (to begin with). This increases reliability of calculations (though no errors were found, in fact) – but also allows for a wider scope. Indeed, we are now able to produce a larger, 4-item grand matrix, and on its basis find the moduses of causative and other forms needed to investigate 4-item syllogism. As well, now each modus can be interpreted with greater precision and causation can be more precisely defined and treated. In this latest phase, the research is brought to a successful finish! Its main ambition, to obtain a complete and reliable listing of all 3-item and 4-item causative syllogisms, being truly fulfilled. This was made technically feasible, in spite of limitations in computer software and hardware, by cutting up problems into smaller pieces. For every mood of the syllogism, it was thus possible to scan for conclusions ‘mechanically’ (using spreadsheets), testing all forms of causative and preventive conclusions. Until now, this job could only be done ‘manually’, and therefore not exhaustively and with certainty. It took over 72’000 pages of spreadsheets to generate the sought for conclusions. This is a historic breakthrough for causal logic and logic in general. Of course, not all conceivable issues are resolved. There is still some work that needs doing, notably with regard to 5-item causative syllogism. But what has been achieved solves the core problem. The method for the resolution of all outstanding issues has definitely now been found and proven. The only obstacle to solving most of them is the amount of labor needed to produce the remaining (less important) tables. As for 5-item syllogism, bigger computer resources are also needed. (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a (...) correct semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the relation of partial ground over the truths of arithmetic (...) and show that the theory is a proof-theoretically conservative extension of the theory PT of positive truth. We construct models for the theory and draw some conclusions for the semantics of conceptualist ground. (shrink)

Theory of Computation -- Computation by Abstracts Devices.

With reference to Polish logical-philosophical tradition two formal theories of language syntax have been sketched and then compared with each other. The first theory is based on the assumption that the basic linguistic stratum is constituted by object-tokens (concrete objects perceived through the senses) and that the types of such objects (ideal objects) are derivative constructs. The other is founded on an opposite philosophical orientation. The two theories are equivalent. The main conclusion is that in syntactic researches (...) it is redundant to postulate the existence of abstract linguistic entities. Earlier, in a slightly different form, the idea was presented in paper "Logiczne podstawy ontologii składni języka" (1988). (shrink)

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of (...) finite-valued first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

Judaic Logic is an original inquiry into the forms of thought determining Jewish law and belief, from the impartial perspective of a logician. Judaic Logic attempts to honestly estimate the extent to which the logic employed within Judaism fits into the general norms, and whether it has any contributions to make to them. The author ranges far and wide in Jewish lore, finding clear evidence of both inductive and deductive reasoning in the Torah and other books of the Bible, (...) and analyzing the methodology of the Talmud and other Rabbinic literature by means of formal tools which make possible its objective evaluation with reference to scientific logic. The result is a highly innovative work – incisive and open, free of clichés or manipulation. Judaic Logic succeeds in translating vague and confusing interpretative principles and examples into formulas with the clarity and precision of Aristotelean syllogism. Among the positive outcomes, for logic in general, are a thorough listing, analysis and validation of the various forms of a-fortiori argument, as well as a clarification of dialectic logic. However, on the negative side, this demystification of Talmudic/Rabbinic modes of thought (hermeneutic and heuristic) reveals most of them to be, contrary to the boasts of orthodox commentators, far from deductive and certain. They are often, legitimately enough, inductive. But they are also often unnatural and arbitrary constructs, supported by unverifiable claims and fallacious techniques. Many other thought-processes, used but not noticed or discussed by the Rabbis, are identified in this treatise, and subjected to logical review. Various more or less explicit Rabbinic doctrines, which have logical significance, are also examined in it. In particular, this work includes a formal study of the ethical logic (deontology) found in Jewish law, to elicit both its universal aspects and its peculiarities. With regard to Biblical studies, one notable finding is an explicit formulation (which, however, the Rabbis failed to take note of and stress) of the principles of adduction in the Torah, written long before the acknowledgement of these principles in Western philosophy and their assimilation in a developed theory of knowledge. Another surprise is that, in contrast to Midrashic claims, the Tanakh (Jewish Bible) contains a lot more than ten instances of qal vachomer (a-fortiori) reasoning. In sum, Judaic Logic elucidates and evaluates the epistemological assumptions which have generated the Halakhah (Jewish religious jurisprudence) and allied doctrines. Traditional justifications, or rationalizations, concerning Judaic law and belief, are carefully dissected and weighed at the level of logical process and structure, without concern for content. This foundational approach, devoid of any critical or supportive bias, clears the way for a timely reassessment of orthodox Judaism (and incidentally, other religious systems, by means of analogies or contrasts). Judaic Logic ought, therefore, to be read by all Halakhists, as well as Bible and Talmud scholars and students; and also by everyone interested in the theory, practise and history of logic. (shrink)

The philosophy of science of Patrick Suppes is centered on two important notions that are part of the title of his recent book (Suppes 2002): Representation and Invariance. Representation is important because when we embrace a theory we implicitly choose a way to represent the phenomenon we are studying. Invariance is important because, since invariants are the only things that are constant in a theory, in a way they give the “objective” meaning of that theory. Every scientific (...) theory gives a representation of a class of structures and studies the invariant properties holding in that class of structures. In Suppes’ view, the best way to define this class of structures is via axiomatization. This is because a class of structures is given by a definition, and this same definition establishes which are the properties that a single structure must possess in order to belong to the class. These properties correspond to the axioms of a logical theory. In Suppes’ view, the best way to characterize a scientific structure is by giving a representation theorem for its models and singling out the invariants in the structure. Thus, we can say that the philosophy of science of Patrick Suppes consists in the application of the axiomatic method to scientific disciplines. What I want to argue in this paper is that this application of the axiomatic method is also at the basis of a new approach that is being increasingly applied to the study of computer science and information systems, namely the approach of formal ontologies. The main task of an ontology is that of making explicit the conceptual structure underlying a certain domain. By “making explicit the conceptual structure” we mean singling out the most basic entities populating the domain and writing axioms expressing the main properties of these primitives and the relations holding among them. So, in both cases, the axiomatization is the main tool used to characterize the object of inquiry, being this object scientific theories (in Suppes’ approach), or information systems (for formal ontologies). In the following section I will present the view of Patrick Suppes on the philosophy of science and the axiomatic method, in section 3 I will survey the theoretical issues underlying the work that is being done in formal ontologies and in section 4 I will draw a comparison of these two approaches and explore similarities and differences between them. (shrink)

This is part two of a two-part paper in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. In this part of the paper, we extend the base theory of the first part of the paper with hierarchically typed truth-predicates and principles about the interaction of partial ground and truth. We show that (...) our theory is a proof-theoretically conservative extension of the ramified theory of positive truth up to. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of (...) QmbC, the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

The purpose of this introduction is to give a rough overview of the discussion of the formalization of arguments, focusing on deductive arguments. The discussion is structured around four important junctions: i) the notion of support, which captures the relation between the conclusion and premises of an argument, ii) the choice of a formal language into which the argument is translated in order to make it amenable to evaluation via formal methods, iii) the question of quality (...) criteria for such formalizations, and finally iv) the choice of the underlying logic. This introductory discussion is supplemented by a brief description of the genesis of the special issue, acknowledgements, and summaries of each article. (shrink)

In the paper, various notions of the logical semiotic sense of linguistic expressions – namely, syntactic and semantic, intensional and extensional – are considered and formalised on the basis of a formal-logical conception of any language L characterised categorially in the spirit of certain Husserl's ideas of pure grammar, Leśniewski-Ajdukiewicz's theory of syntactic/semantic categories and, in accordance with Frege's ontological canons, Bocheński's and some of Suszko's ideas of language adequacy of expressions of L. The adequacy ensures (...) their unambiguous syntactic and semantic senses and mutual, syntactic and semantic correspondence guaranteed by the acceptance of a postulate of categorial compatibility of syntactic and semantic (extensional and intensional) categories of expressions of L. This postulate defines the unification of these three logical senses. There are three principles of compositionality which follow from this postulate: one syntactic and two semantic ones already known to Frege. They are treated as conditions of homomorphism of partial algebra of L into algebraic models of L: syntactic, intensional and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, obviously, an idealisation. The syntactic and semantic unambiguity of its expressions is not, of course, a feature of natural languages, but every syntactically and semantically ambiguous expression of such languages may be treated as a schema representing all of its interpretations that are unambiguous expressions. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; (...) specifically, with Level Theory, as developed in Part 1. (shrink)

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x (...) ⊧ ⍯φ iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

Inquiry into the meaning of logical terms in natural language (‘and’, ‘or’, ‘not’, ‘if’) has generally proceeded along two dimensions. On the one hand, semantic theories aim to predict native speaker intuitions about the natural language sentences involving those logical terms. On the other hand, logical theories explore the formal properties of the translations of those terms into formal languages. Sometimes, these two lines of inquiry appear to be in tension: for instance, our best logical investigation (...) into conditional connectives may show that there is no conditional operator that has all the properties native speaker intuitions suggest if has. Indicative conditionals have famously been the source of one such tension, ever since the triviality proofs of both Lewis (1976) and Gibbard (1981) established conclusions which are in prima facie tension with ordinary judgments about natural language indicative conditionals. In a recent series of papers, Branden Fitelson has strengthened both triviality results (Fitelson 2013, 2015, 2016), revealing a common culprit: a logical schema known as IMPORT-EXPORT. Fitelson’s results focus the tension between the logical results and ordinary judgments, since IMPORT-EXPORT seems to be supported by intuitions about natural language. In this paper, we argue that the intuitions which have been taken to support IMPORT-EXPORT are really evidence for a closely related, but subtly different, principle. We show that the two principles are independent by showing how, given a standard assumption about the conditional operator in the formal language in which IMPORT-EXPORT is stated, many existing theories of indicative conditionals validate one, but not the other. Moreover, we argue that once we clearly distinguish these principles, we can use propositional anaphora to show that IMPORT-EXPORT is in fact not valid for natural language indicative conditionals (given this assumption about the formal conditional operator). This gives us a principled and independently motivated way of rejecting a crucial premise in many triviality results, while still making sense of the speaker intuitions which appeared to motivate that premise. We suggest that this strategy has broad application and an important lesson: in theorizing about the logic of natural language, we must pay careful attention to the translation between the formal languages in which logical results are typically proved, and natural languages which are the subject matter of semantic theory. (shrink)

In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and (...) simultaneously a tool of its cognition. In the logical conception of language L, its expressions should satisfy some general conditions of language adequacy. The adequacy ensures their unambiguous syntactic and semantic senses and mutual, syntactic, and semantic compatibility, correspondence guaranteed by the acceptance of a postulate of categorial compatibility syntactic and semantic categories of expressions of L. From this postulate, three principles of compositionality follow: one syntactic and two semantic already known to Frege. They are treated as conditions of homomorphism partial algebra of L into algebraic models of L: syntactic, intensional, and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, of course, an idealization, but only expressions with high degrees of precision of their senses, after due justification, may become theorems of science. (shrink)