Could the intersection of [formal proofs of mathematical logic] and [sound deductive inference] specify formal systems having [deductively sound formal proofs of mathematical logic]? All that we have to do to provide [deductively sound formal proofs of mathematical logic] is select the subset of conventional [formal proofs of mathematical logic] having true premises and now we have [deductively sound formal proofs of mathematical logic].

Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to deductive conclusions without any need for other representations.

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)

To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.

Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature. Properties of mathematical or deductive systems can thereby sometimes falsely be ascribed to natural systems.

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)

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)

Searle proposes an argument in order to prove the existence of universals and thereby solve the problem of universals: From every meaningful general term P(x) follows a tautology Vx[P(x) v -P(x)], which entails the existence of the corresponding universal P. To be convincing, this argument for existence must be valid, it must presume true premises and it must be free of any informal fallacy. First, the validity of the argument for existence in its non-modal interpretation will be proven with the (...) help of the formal deductive system F. Secondly, it will be shown that a self-contradictory tautology concept is employed, which renders the premises meaningless. Consequently, the inconsistency will be emended through redefinition and the argument's ensuing correctness will be demonstrated. Finally, it will be shown that the argument for existence presupposes the existence of universals in its premise and hence begs the question. (shrink)

forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), symbolizing English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as modal logic, soundness, and functional completeness. Exercises with solutions are (...) available. It is provided in PDF (for screen reading, printing, and a special version for dyslexics), HTML, and in LaTeX source code. (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)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the (...) categoricity problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (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)

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic value of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide the valid deductive inference. Sound deductive conclusions are the result of these finite string transformation rules.

Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.

This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 presents (...) the model-theoretic concepts, based on those in [7], that guide the rest of this paper. Section 3 presents Natural Deduction systems IK and CK, formalizations of intuitionistic and classical one-step versions of K. In these systems, occurrences of step-markers allow deductions to display deductive structure that is covered over in familiar “no step” proof-theoretic systems for such logics. Box and Diamond are governed by Introduction and Elimination rules; the familiar K rule and Necessitation are derived (i.e. admissible) rules. CK will be the result of adding the 0-version of the Rule of Excluded Middle to the rules which generate IK. Note: IK is the result of merely dropping that rule from those generating CK, without addition of further rules or axioms (as was needed in [7]). These proof-theoretic systems yield intuitionistic and classical consequence relations by the obvious definition. Section 4 provides some examples of what can be deduced in IK. Section 5 defines some proof-theoretic concepts that are used in Section 6 to prove the soundness of the consequence relation for IK (relative to the class of models defined in Section 2.) Section 7 proves its completeness (relative to that class). Section 8 extends these results to the consequence relation for CK. (Looking ahead: Part 2 will investigate one-step proof-theoretic systems formalizing intuitionistic and classical one-step versions of some familiar logics stronger than K.). (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)

This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches in the (...) discovery of semantic software theories are refused to argue in favour of the abductive process of hypothesising and refining models at each level in the hierarchy, until they become satisfactorily predictive. Empirical theories of computational systems are required to be modular, as modular are most software verification and testing activities. We argue that logic relations must be thereby defined among models representing different modules in a semantic theory of a modular software system. We exclude that scientific structuralism is able to define module relations needed in software modular theories. The algebraic Theory of Institutions is finally introduced to specify the logic structure of modular semantic theories of computational systems. (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)

Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the (...) categoricity problem is generated by the finite nature of the standard calculi and one direction in which it can be solved is to strengthen the deductive systems by adding infinitary rules (such as the ω-rule), i.e., to construct a full formalization. Another main direction is to provide a natural semantics for the standard rules of inference, i.e., a semantics for which these rules are categorical. My aim in this paper is to analyze some recent approaches for solving the categoricity problem and to argue that a logical inferentialist should accept the infinitary rules of inference for the first order quantifiers, since our use of the expressions “all” and “there is” leads us beyond the concrete and finite reasoning, and human beings do sometimes employ infinitary rules of inference in their reasoning. (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)

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)

In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction (...) system of Wansing's bi-intuitionistic logic 2Int, which I will turn into a term-annotated form. Therefore, we need a type theory that extends to a two-sorted typed lambda-calculus. I will present such a term-annotated proof system for 2Int and prove a Dualization Theorem relating proofs and refutations in this system. On the basis of these formal results I will argue that this gives us interesting insights into questions about sense and denotation as well as synonymy and identity of proofs from a bilateralist point of view. (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 idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...) and developed by his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

This study purports a unifying view of the ontology of mathematics and fiction presented in Husserl’s 1894 manuscript “Intentional Objects” [Intentionale Gegenstände] in relation to his theory of manifolds. In particular, I clarify that Husserl’s argument supposes deductive systems of mathematical theories and fictional work as well as their “correlates,” which are mathematical manifolds in the former cases. This unifying view concretizes the concept of manifolds as an ontological concept that is not bound to mathematics. Although mathematical and fictional (...) objects differ in whether they are purely formal or materially filled, the concept of manifolds can be extended to admit materially filled objects, thus encompassing the two into the unitary theory of manifolds. By contrast, reviewing the subsequent developments of Husserl’s theory of manifolds naturally leads to restricting its concept to be strictly formal. This notion is consistent with the view that describes manifolds as forms of worlds and states of affairs; however, I suggest that the concept of the manifold is more fundamental than the concept of the world and state of affairs. (shrink)

This presentation of Aristotle's natural deduction system supplements earlier presentations and gives more historical evidence. Some fine-tunings resulted from conversations with Timothy Smiley, Charles Kahn, Josiah Gould, John Kearns,John Glanvillle, and William Parry.The criticism of Aristotle's theory of propositions found at the end of this 1974 presentation was retracted in Corcoran's 2009 HPL article "Aristotle's demonstrative logic".

When adopting a sound logical system, reasonings made within this system are correct. The situation with reasonings expressed, at least in part, with natural language is much more ambiguous. One way to be certain of the correctness of these reasonings is to provide a logical model of them. To conclude that a reasoning process is correct we need the logical model to be faithful to the reasoning. In this case, the reasoning inherits, so to speak, the correctness of (...) the logical model. There is a weak link in this procedure, which we call the faithfulness problem: how do we decide that the logical model is faithful to the reasoning that it is supposed to model? That is an issue external to logic, and we do not have rigorous formal methods to make the decision. The purpose of this paper is to expose the faithfulness problem (not to solve it). For that purpose, we will consider two examples, one from the geometrical reasoning in Euclid’s Elements and the other from a study on deductive reasoning in the psychology of reasoning. (shrink)

A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.

This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...) and Grzegorz Bryll. -/- -/- . (shrink)

ABSTRACT: For the Stoics, a syllogism is a formally valid argument; the primary function of their syllogistic is to establish such formal validity. Stoic syllogistic is a system of formal logic that relies on two types of argumental rules: (i) 5 rules (the accounts of the indemonstrables) which determine whether any given argument is an indemonstrable argument, i.e. an elementary syllogism the validity of which is not in need of further demonstration; (ii) one unary and three binary (...) argumental rules which establish the formal validity of non-indemonstrable arguments by analysing them in one or more steps into one or more indemonstrable arguments (cut type rules and antilogism). The function of these rules is to reduce given non-indemonstrable arguments to indemonstrable syllogisms. Moreover, the Stoic method of deduction differs from standard modern ones in that the direction is reversed (similar to tableau methods). The Stoic system may hence be called an argumental reductive system of deduction. In this paper, a reconstruction of this system of logic is presented, and similarities to relevance logic are pointed out. (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)

I argue 1) That in his celebrated Is/Ought passage, Hume employs ‘deduction’ in the strict sense, according to which if a conclusion B is justly or evidently deduced from a set of premises A, A cannot be true and B false, or B false and the premises A true. 2) That Hume was following the common custom of his times which sometimes employed ‘deduction’ in a strict sense to denote inferences in which, in the words of Dr Watts’ Logick, ‘the (...) premises, according to the reason of things, do really contain the conclusion that is deduced from them’; that although Hume sometimes uses ‘demonstrative argument’ as a synonym for ‘deduction’, like most of his contemporaries, he generally reserves the word ‘demonstration’ for deductive inferences in which the premises are both necessary and self-evident. 3) That Mr Hume did indeed mean to suggest that deductions from IS to OUGHT were ‘altogether inconceivable’ since if ought represents a new relation or affirmation, it cannot, in the strict sense, be justly deduced from premises which do not really contain it. 4) That in a large and liberal (or perhaps loose and promiscuous) sense Hume does deduce oughts and ought nots from observations concerning human affairs, but that the deductions in question are not inferences, but explanations, since in another sense of ‘deduce’, common in the Eighteenth Century, to deduce B from A is to trace B back to A or to explain B in terms of A; 5) That a small attention to the context of Hume’s remarks and to the logical notions on which they are based would subvert those vulgar systems of philosophy which exaggerate the distinction between fact and value; for just because it is ‘altogether inconceivable’ that the new relation or affirmation OUGHT should be a deduction from others that are entirely different from it, it does not follow that the facts represented by IS and IS NOT are at bottom any different from the values represented by OUGHT and OUGHT NOT. (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)

I use the Corcoran–Smiley interpretation of Aristotle's syllogistic as my starting point for an examination of the syllogistic from the vantage point of modern proof theory. I aim to show that fresh logical insights are afforded by a proof-theoretically more systematic account of all four figures. First I regiment the syllogisms in the Gentzen–Prawitz system of natural deduction, using the universal and existential quantifiers of standard first-order logic, and the usual formalizations of Aristotle's sentence-forms. I explain how the syllogistic (...) is a fragment of my system of Core Logic. Then I introduce my main innovation: the use of binary quantifiers, governed by introduction and elimination rules. The syllogisms in all four figures are re-proved in the binary system, and are thereby revealed as all on a par with each other. I conclude with some comments and results about grammatical generativity, ecthesis, perfect validity, skeletal validity and Aristotle's chain principle. (shrink)

PLEASE NOTE: This is the corrected 2nd eBook edition, 2021. ●●●●● _Critique of Impure Reason_ has now also been published in a printed edition. To reduce the otherwise high price of this scholarly, technical book of nearly 900 pages and make it more widely available beyond university libraries to individual readers, the non-profit publisher and the author have agreed to issue the printed edition at cost. ●●●●● The printed edition was released on September 1, 2021 and is now available through (...) all booksellers, including Barnes & Noble, Amazon, and brick-and-mortar bookstores under ISBN 978-0-578-88646-6. ●●●●● In light of the length of this book, readers who would like to have a more detailed description of the book's objectives and method may find it helpful to read the detailed and clearly written Wikipedia entry about this work: From the Wikipedia search page, use the search phrase "Critique of Impure Reason". At least at the time of this writing (11/29/2021), the Wikipedia entry is well-researched and accurate. ●●●●● In addition, a "Primer on Bartlett's CRITIQUE OF IMPURE REASON" has been made available by the author. It is available under its title through PhilPapers and other philosophy online archives. ●●●●● COMMENDATIONS OF THIS WORK, from the back cover of the published edition: ●●●●● “I admire its range of philosophical vision.” – Nicholas Rescher, Distinguished University Professor of Philosophy, University of Pittsburgh, author of more than 100 books. ●●●●● “Bartlett’s _Critique of Impure Reason_ is an impressive, bold, and ambitious work. Careful scholarship is balanced by original analyses that lead the reader to recognize the limits of meaning, knowledge, and conceptual possibility. The work addresses a host of traditional philosophical problems, among them the nature of space, time, causality, consciousness, the self, other minds, ontology, free will and determinism, and others. The book culminates in a fascinating and profound new understanding of relativity physics and quantum theory.” – Gerhard Preyer, Professor of Philosophy, Goethe-University, Frankfurt am Main, Germany, author of many books including _Concepts of Meaning_, _Beyond Semantics and Pragmatics_, _Intention and Practical Thought_, and _Contextualism in Philosophy_. ●●●●● “[This work’s] goal is of a unique and difficult species: Dr. Bartlett seeks to develop a formal logical calculus on the basis of transcendental philosophical arguments; in fact, he hopes that this calculus will be the formal expression of the transcendental foundation of knowledge.... I consider Dr. Bartlett’s work soundly conceived and executed with great skill.” – C. F. von Weizsäcker, philosopher and physicist, former Director, Max-Planck-Institute, Starnberg, Germany. ●●●●● “Bartlett has written an American “Prolegomena to All Future Metaphysics.” He aims rigorously to eliminate meaningless assertions, reach bedrock, and place philosophy on a firm foundation that will enable it, like science and mathematics, to produce lasting results that generations to come can build on. This is a great book, the fruit of a lifetime of research and reflection, and it deserves serious attention.” — Martin X. Moleski, former Professor, Canisius College, Buffalo, NY, studies of scientific method, the presuppositions of thought, and the self-referential nature of epistemology. ●●●●● “Bartlett has written a book on what might be called the underpinnings of philosophy. It has fascinating depth and breadth, and is all the more striking due to its unifying perspective based on the concepts of reference and self-reference.” – Don Perlis, Professor of Computer Science, University of Maryland, author of numerous publications on self-adjusting autonomous systems and philosophical issues concerning self-reference, mind, and consciousness. ●●●●● ●●●●● The _Critique of Impure Reason: Horizons of Possibility and Meaning_ comprises a major and important contribution to philosophy. Thanks to the generosity of its publisher, this massive 885-page volume has been published as a free open access eBook (3.75MB) as well as an open access printed edition. It inaugurates a revolutionary paradigm shift in philosophical thought by providing compelling and long-sought-for solutions to a wide range of philosophical problems. In the process, the work fundamentally transforms the way in which the concepts of reference, meaning, and possibility are understood. The book includes a Foreword by the celebrated German philosopher and physicist Carl Friedrich von Weizsäcker. ●●●●● In Kant’s _Critique of Pure Reason_ we find an analysis of the preconditions of experience and of knowledge. In contrast, but yet in parallel, the new _Critique_ focuses upon the ways—unfortunately very widespread and often unselfconsciously habitual—in which many of the concepts that we employ _conflict_ with the very preconditions of meaning and of knowledge. ●●●●● This is a book about the boundaries of frameworks and about the unrecognized conceptual confusions in which we become entangled when we attempt to transgress beyond the limits of the possible and meaningful. We tend either not to recognize or not to accept that we all-too-often attempt to trespass beyond the boundaries of the frameworks that make knowledge possible and the world meaningful. ●●●●● The _Critique of Impure Reason_ proposes a bold, ground-breaking, and startling thesis: that a great many of the major philosophical problems of the past can be solved through the recognition of a viciously deceptive form of thinking to which philosophers as well as non-philosophers commonly fall victim. For the first time, the book advances and justifies the criticism that a substantial number of the questions that have occupied philosophers fall into the category of “impure reason,” violating the very conditions of their possible meaningfulness. ●●●●● The purpose of the study is twofold: first, to enable us to recognize the boundaries of what is referentially forbidden—the limits beyond which reference becomes meaningless—and second, to avoid falling victims to a certain broad class of conceptual confusions that lie at the heart of many major philosophical problems. As a consequence, the boundaries of _possible meaning_ are determined. ●●●●● Bartlett, the author or editor of more than 20 books, is responsible for identifying this widespread and delusion-inducing variety of error, _metalogical projection_. It is a previously unrecognized and insidious form of erroneous thinking that undermines its own possibility of meaning. It comes about as a result of the pervasive human compulsion to seek to transcend the limits of possible reference and meaning. ●●●●● Based on original research and rigorous analysis combined with extensive scholarship, the _Critique of Impure Reason_ develops a self-validating method that makes it possible to recognize, correct, and eliminate this major and pervasive form of fallacious thinking. In so doing, the book provides at last provable and constructive solutions to a wide range of major philosophical problems. ●●●●● CONTENTS AT A GLANCE ▪▪▪▪▪ Preface ▪▪▪▪▪ Foreword by Carl Friedrich von Weizsäcker ▪▪▪▪▪ Acknowledgments ▪▪▪▪▪ Avant-propos: A philosopher’s rallying call ▪▪▪▪▪ Introduction ▪▪▪▪▪ A note to the reader ▪▪▪▪▪ A note on conventions ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART I ▪▪▪▪▪ ▪▪▪▪▪ WHY PHILOSOPHY HAS MADE NO PROGRESS AND HOW IT CAN ▪▪▪▪▪ 1 Philosophical-psychological prelude ▪▪▪▪▪ 2 Putting belief in its place: Its psychology and a needed polemic ▪▪▪▪▪ 3 Turning away from the linguistic turn: From theory of reference to metalogic of reference ▪▪▪▪▪ 4 The stepladder to maximum theoretical generality ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART II ▪▪▪▪▪ THE METALOGIC OF REFERENCE ▪▪▪▪▪ A New Approach to Deductive, Transcendental Philosophy ▪▪▪▪▪ 5 Reference, identity, and identification ▪▪▪▪▪ 6 Self-referential argument and the metalogic of reference ▪▪▪▪▪ 7 Possibility theory ▪▪▪▪▪ 8 Presupposition logic, reference, and identification ▪▪▪▪▪ 9 Transcendental argumentation and the metalogic of reference ▪▪▪▪▪ 10 Framework relativity ▪▪▪▪▪ 11 The metalogic of meaning ▪▪▪▪▪ 12 The problem of putative meaning and the logic of meaninglessness ▪▪▪▪▪ 13 Projection ▪▪▪▪▪ 14 Horizons ▪▪▪▪▪ 15 De-projection ▪▪▪▪▪ 16 Self-validation ▪▪▪▪▪ 17 Rationality: Rules of admissibility ▪▪▪▪▪ ▪▪▪▪▪ ▪▪▪▪▪ PART III ▪▪▪▪▪ PHILOSOPHICAL APPLICATIONS OF THE METALOGIC OF REFERENCE ▪▪▪▪▪ Major Problems and Questions of Philosophy and the Philosophy of Science ▪▪▪▪▪ 18 Ontology and the metalogic of reference ▪▪▪▪▪ 19 Discovery or invention in general problem-solving, mathematics, and physics ▪▪▪▪▪ 20 The conceptually unreachable: “The far side” ▪▪▪▪▪ 21 The projections of the external world, things-in-themselves, other minds, realism, and idealism ▪▪▪▪▪ 22 The projections of time, space, and space-time ▪▪▪▪▪ 23 The projections of causality, determinism, and free will ▪▪▪▪▪ 24 Projections of the self and of solipsism ▪▪▪▪▪ 25 Non-relational, agentless reference and referential fields ▪▪▪▪▪ 26 Relativity physics as seen through the lens of the metalogic of reference ▪▪▪▪▪ 27 Quantum theory as seen through the lens of the metalogic of reference ▪▪▪▪▪ 28 Epistemological lessons learned from and applicable to relativity physics and quantum theory ▪▪▪▪▪ ▪▪▪▪▪ PART IV ▪▪▪▪▪ HORIZONS ▪▪▪▪▪ 29 Beyond belief ▪▪▪▪▪ 30 _Critique of Impure Reason_: Its results in retrospect ▪▪▪▪▪ ▪▪▪▪▪ SUPPLEMENT ▪▪▪▪▪ The Formal Structure of the Metalogic of Reference ▪▪▪▪▪ APPENDIX I ▪▪▪▪▪ The Concept of Horizon in the Work of Other Philosophers ▪▪▪▪▪ APPENDIX II ▪▪▪▪▪ Epistemological Intelligence ▪▪▪▪▪ References ▪▪▪▪▪ Index ▪▪▪▪▪ About the author. (shrink)

This paper presents a new system of logic, LF, that is intended to be used as the foundation of the formalization of science. That is, deductive validity according to LF is to be used as the criterion for assessing what follows from the verdicts, hypotheses, or conjectures of any science. In work currently in progress, we argue for the unique suitability of LF for the formalization of logic, mathematics, syntax, and semantics. The present document specifies the language and (...) rules of LF, lays out some notational conventions, and states some basic technical facts about the system. (shrink)

We can simply define Gödel 1931 Incompleteness away by redefining the meaning of the standard definition of Incompleteness: A theory T is incomplete if and only if there is some sentence φ such that (T ⊬ φ) and (T ⊬ ¬φ). This definition construes the existence of self-contradictory expressions in a formal system as proof that this formal system is incomplete because self-contradictory expressions are neither provable nor disprovable in this formal system. Since self-contradictory (...) expressions are neither provable nor disprovable only because they are self-contradictory we could define them as unsound instead of defining the formal system as incomplete. (shrink)

Edward Nieznański developed two logical systems in order to deal with a version of the problem of evil associated with two formulations of religious determinism. The aim of this research was to revisit these systems, providing them with a more appropriate formalization. The new resulting systems, namely, N1 and N2, were reformulated in first-order modal logic; they retain much of their original basic structures, but some additional results were obtained. Furthermore, our research found that an underlying minimal set of axioms (...) is enough to settle the questions proposed. Thus, we developed a minimal system, called N3, that solves the same issues tackled by N1 and N2, but with less assumptions than these systems. All of the systems developed here are proposed as solutions to the logical problem of evil through the refutation of two versions of religious determinism, showing that the attributes of God in Classical Theism, namely, those of omniscience, omnipotence, infallibility, and omnibenevolence, when formalized, are consistent with the existence of evil, providing one more response to this traditional issue. (shrink)

Reasoning over our knowledge bases and theories often requires non-deductive inferences, especially – but by no means only – when commonsense reasoning is the case, i.e. when practical agency is called for. This kind of reasoning can be adequately formalized via the notion of supraclassical consequence, a non-deductive consequence tightly associated with default and non-monotonic reasoning and featuring centrally in abductive, inductive, and probabilistic logical systems. In this paper, we analyze core concepts and problems of these systems in (...) the light of supraclassical consequence. (shrink)

I discuss Smokrović’s work on the normativity of logic (Smokrović 2017, Smokrović 2018). I agree that the classical formal logic is not an adequate model for real-life reasoning. But I present some doubts about his notion of deductive logic and his proposal to model such reasoning in non-monotonic logic. No branch of formal logic by itself is likely to capture real-life inferential links (reasoned-inference). I use the logic of relevance as my case study and extend the pessimistic (...) morals to modern systems of non-classical logic. Finally, I propose a more lax conception of normativty: there is a connection between logical assessment in the broad sense (as sanctioned by the notion of cogency) and the evaluation and criticism of reasoning. (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-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)

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)

In this paper we prove the completeness of three logical systems I LI, IL2 and IL3. IL1 deals solely with identities {a = b), and its deductions are the direct deductions constructed with the three traditional rules: (T) from a = b and b = c infer a = c, (S) from a = b infer b = a and (A) infer a = a(from anything). IL2 deals solely with identities and inidentities {a ± b) and its deductions include both (...) the direct and the indirect deductions constructed with the three traditional rules. IL3 is a hybrid of IL1 and IL2: its deductions are all direct as in IL1 but it deals with identities and inidentities as in IL2. IL1 and IL2 have a high degree of naturalness. Although the hybrid system IL3 was constructed as an artifact useful in the mathematical study of IL1 and IL2, it nevertheless has some intrinsically interesting aspects. The main motivation for describing and studying such simple systems is pedagogical. In teaching beginning logic one would like to present a system of logic which has the following properties. First, it exemplifies the main ideas of logic: implication, deduction, non-implication, counterargument(or countermodel), logical truth, self-contradiction, consistency,satisfiability, etc. Second, it exemplifies the usual general metaprinciples of logic: contraposition and transitivity of implication, cut laws, completeness,soundness, etc. Third, it is simple enough to be thoroughly grasped by beginners. Fourth, it is obvious enough so that its rules do not appear to be arbitrary or purely conventional. Fifth, it does not invite confusions which must be unlearned later. Sixth, it involves a minimum of presuppositions which are no longer accepted in mainstream contemporary logic. (shrink)

The aim of this study is to justify the belief that there are biological normative mechanisms that fulfill non-trivial causal roles in the explanations (as formulated by researchers) of actions and behaviors present in specific systems. One example of such mechanisms is the predictive mechanisms described and explained by predictive processing (hereinafter PP), which (1) guide actions and (2) shape causal transitions between states that have specific content and fulfillment conditions (e.g. mental states). Therefore, I am guided by a specific (...) theoretical goal associated with the need to indicate those conditions that should be met by the non-trivial theory of normative mechanisms and the specific models proposed by PP supporters. In this work, I use classical philosophical methods, such as conceptual analysis and critical reflection. I also analyze selected studies in the field of cognitive science, cognitive psychology, neurology, information theory and biology in terms of the methodology, argumentation and language used, in accordance with their theoretical importance for the issues discussed in this study. In this sense, the research presented here is interdisciplinary. My research framework is informed by the mechanistic model of explanation, which defines the necessary and sufficient conditions for explaining a given phenomenon. The research methods I chose are therefore related to the problems that I intend to solve. In the introductory chapter, “The concept of predictive processing”, I discuss the nature of PP as well as its main assumptions and theses. I also highlight the key concepts and distinctions for this research framework. Many authors argue that PP is a contemporary version of Kantianism and is exposed to objections similar to those made against the approach of Immanuel Kant. I discuss this thesis and show that it is only in a very general sense that the PP framework is neo-Kantian. Here we are not dealing with transcendental deduction nor with the application of transcendental arguments. I argue that PP is based on reverse engineering and abduction inferences. In the second part of this chapter, I respond to the objection formulated by Dan Zahavi, who directly accuses this research framework of anti-realistic consequences. I demonstrate that the position of internalism, present in the so-called conservative PP, does not imply anti-realism, and that, due to the explanatory role played in it by structural representations directed at real patterns, it is justified to claim that PP is realistic. In this way, I show that PP is a non-trivial research framework, having its subject, specific methods and its own epistemic status. Finally, I discuss positions classified as the socalled radical PP. In the chapter “Predictive processing as a Bayesian explanatory model” I justify the thesis according to which PP offers Bayesian modeling. Many researchers claim that the brain is an implemented statistical probabilistic network that is an approximation of the Bayesian 7 rule. In practice, this means that all cognitive processes are to apply Bayes' rule and can be described in terms of probability distributions. Such a solution arouses objections among many researchers and is the subject of wide criticism. The purpose of this chapter is to justify the thesis that Bayesian PP is a non-trivial research framework. For this purpose, I argue that it explains certain phenomena not only at the computational level described by David Marr, but also at the level of algorithms and implementation. Later in this chapter I demonstrate that PP is normative modeling. Proponents of the use of Bayesian models in psychology or decision theory argue that they are normative because they allow the formulation of formal rules of action that show what needs to be done to make a given action optimal. Critics of this approach emphasize that such thinking about the normativity of Bayesian modeling is unjustified and that science should shift from prescriptive to descriptive positions. In a polemic with Shira Elqayam and Jonathan Evans (2011), I show that the division they propose into prescriptivism and Bayesian descriptivism is apparent, because, as I argue, there are two forms of prescriptivism, i.e. the weak and the strong. I argue that the weak version is epistemic and can lead to anti-realism, while the strong version is ontic and allows one to justify realism in relation to Bayesian models. I argue that a weak version of prescriptivism is valid for PP. It allows us to adopt anti-realism in relation to PP. In practice, this means that you can explain phenomena using Bayes' rule. This does not, however, imply that they are Bayesian in nature. However, the full justification of realism in relation to the Bayesian PP presupposes the adoption of strong prescriptivism. This position assumes that phenomena are explained by Bayesian rule because they are Bayesian as such. If they are Bayesian in nature, then they should be explained using Bayesian modeling. This thesis will be substantiated in the chapters “Normative functions and mechanisms in the context of predictive processing” and “Normative mechanisms and actions in predictive processing”. In the chapter “The Free Energy Principle in predictive processing”, I discuss the Free Energy Principle (hereinafter FEP) formulated by Karl Friston and some of its implications. According to this principle, all biological systems (defined in terms of Markov blankets) minimize the free energy of their internal states in order to maintain homeostasis. Some researchers believe that PP is a special case of applying this principle to cognition, and that predictive mechanisms are homeostatic mechanisms that minimize free energy. The discussion of FEP is important due to the fact that some authors consider it to be important for explanatory purposes and normative. If this is the case, then FEP turns out to be crucial in explaining normative predictive mechanisms and, in general, any normative biological mechanisms. To define the explanatory possibilities of this principle, I refer to the discussion of its supporters on the issue they define as the problem of continuity and discontinuity between life and mind. A critical analysis of this discussion and the additional arguments I have formulated have allowed me to revise the explanatory ambitions of FEP. I also reject the belief that this principle is necessary to explain the nature of predictive mechanisms. I argue that the principle formulated and defended by Friston is an important research heuristic for PP analysis. 8 In the chapter “Normative functions and mechanisms in predictive processing”, I start my analyzes by formulating an answer to the question about the normative nature of homeostatic mechanisms. I demonstrate that predictive mechanisms are not homeostatic. I defend the view that a full explanation of normative mechanisms presupposes an explanation of normative functions. I discuss the most important proposals for understanding the normativity of a function, both from a systemic and teleosemantic perspective. I conclude that the non-trivial concept of a function must meet two requirements which I define as explanatory and normative. I show that none of the theories I have invoked satisfactorily meets both of these requirements. Instead, I propose a model of normativity based on Bickhard's account, but supplemented by a mechanistic perspective. I argue that a function is normative when: (1) it allows one to explain the dysfunction of a given mechanism; (2) it contributes to the maintenance of the organism's stability by shaping and limiting possible relations, processes and behaviors of a given system; and when (3) (according to the representational and predictive functions) it enables explaining the attribution of logical values of certain representations / predictions. In such an approach, a mechanism is normative when it performs certain normative functions and when it is constitutive for a specific action or behavior, despite the fact that for some reason it cannot realize it either currently or in the long-term. Such an understanding of the normativity of mechanisms presupposes the acceptance of the epistemic hypothesis. I argue that this hypothesis is not cognitively satisfactory, and therefore the ontic hypothesis should be justified, which is directly related to adopting the position of ontic prescriptivism. For this reason, referring to the mechanistic theory of scientific explanations, I formulate an ontical interpretation of the concept of a normative mechanism. According to this approach, a mechanism or a function is normative when they perform such and such causal roles in explaining certain actions and behaviors. With regard to the normative properties of predictive mechanisms and functions, this means that they are the causes of specific actions an organism carries out in the environment. In this way, I justify the necessity of accepting the ontic hypothesis and rejecting the epistemic hypothesis. The fifth chapter, “Normative mechanisms and actions in predictive processing”, is devoted to the dark room problem and the related exploration-exploitation trade-off. A dark room is the state that an agent could be in if it minimized the sum of all potential prediction errors. I demonstrate that, in accordance with the basic assumption of PP about the need for continuous and long-term minimization of prediction errors, such a state should be desirable for the agent. Is it really so? Many authors believe it is not. I argue that the test of the value of PP is the possibility of a non-trivial solution of this problem, which can be reduced to the choice between active and uncertainty-increasing exploration and safe and easily predictable exploitation. I show that the solution proposed by PP supporters present in the literature does not enable a fully satisfactory explanation of this dilemma. Then I defend the position according to which the full explanation of the normative mechanisms, and, subsequently, the solution to the dilemma of exploration and exploitation, involves reference to the existence of constraints present in the environment. The constraints 9 include elements of the environment that make a given mechanism not only causal but also normative. They are therefore key to explaining the predictive mechanisms. They do not only play the role of the context in which the mechanism is implemented, but, above all, are its constitutive component. I argue that the full explanation of the role of constraints in normative predictive mechanisms presupposes the integration of individual models of specific cognitive phenomena, because only the mechanistic integration of PP with other models allows for a non-trivial explanation of the nature of normative predictive mechanisms that would have a strong explanatory value. The explanatory monism present in many approaches to PP makes it impossible to solve the problem of the dark room. Later in this chapter, I argue that the Bayesian PP is normative not because it enables the formulation of such and such rules of action, but because the predictive mechanisms themselves are normative. They are normative because they condition the choice of such and such actions by agents. In this way, I justify the hypothesis that normative mechanisms make it possible to explain the phenomenon of agent motivation, which is crucial for solving the dark room problem. In the last part of the chapter, I formulate the hypothesis of distributed normativity, which assumes that the normative nature of certain mechanisms, functions or objects is determined by the relations into which these mechanisms, functions or objects enter. This means that what is normative (in the primary sense) is the relational structure that constitutes the normativity of specific items included in it. I suggest that this hypothesis opens up many areas of research and makes it possible to rethink many problems. In the “Conclusion”, I summarize the results of my research and indicate further research perspectives. (shrink)

It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also be proved by (...) means of independence-friendly logic that proof-theoretical consistency of a sentence S implies the existence of a model in which S is not false. Hence the consistency of the axioms of arithmetic in the sense of being not-false in a model can be proved. (shrink)

It is widely taken that the first-order part of Frege's Begriffsschrift is complete. However, there does not seem to have been a formal verification of this received claim. The general concern is that Frege's system is one axiom short in the first-order predicate calculus comparing to, by now, the standard first-order theory. Yet Frege has one extra inference rule in his system. Then the question is whether Frege's first-order calculus is still deductively sufficient as far as the (...) first-order completeness is concerned. In this short note we confirm that the missing axiom is derivable from his stated axioms and inference rules, and hence the logic system in the Begriffsschrift is indeed first-order complete. (shrink)

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

The conventional notion of a formal system is adapted to conform to the sound deductive inference model operating on finite strings. Finite strings stipulated to have the semantic property of Boolean true provide the sound deductive premises. Truth preserving finite string transformation rules provide valid the deductive inference. Conclusions of sound arguments are derived from truth preserving finite string transformations applied to true premises.

This special issue of the Logic Journal of the IGPL includes revised and updated versions of the best work presented at the fourth edition of the workshop Formal Ap- proaches to Multi-Agent Systems, FAMAS'09, which took place in Turin, Italy, from 7 to 11 September, 2009, under the umbrella of the Multi-Agent Logics, Languages, and Organisations Federated Workshops (MALLOW). -/- Just like its predecessor, research reported in this FAMAS 2009 special issue is very much inspired by practical concerns. This (...) time the authors of all the five selected papers are concerned with knowledge and beliefs in multi-agent settings: How to create a group belief in a fair way from individual plausibility orderings? How to close gaps and resolve ambiguities in a tractable way, when information comes from multiple sources? How to reason about a spatial environment? How to compare the strengths of an agent's beliefs in a principled way? How to decide as efficiently as possible whether a given formula concerning group beliefs is valid? These questions and their answers lead to a multi-faceted and at the same time coherent special issue. We concisely introduce the five articles. (shrink)

The work of this dissertation, in a broad sense, seeks to rescue what may be in the original project or nucleus of philosophy, from its Socratic arising: the idea of elucidative rationality. This rationality is aimed at expressing our practices in a way that can be confronted with objections and alternatives. The notion of expression is central to this rationality. This centrality is elucidated by the contemporary philosopher Brandom (1994, 2000, 2008a, 2013), from his view of the semantic inferentialism. With (...) this view, this dissertation, in a strict sense, investigates evidences that leads to the distinction of the inferentially expressivist tradition of syllogistic. In this semantic inferentialism, logic is the “organ of semantic self-consciousness”. In this sense, logic does not define the rational, in the most basic sense, but allows us to be aware, through inferential articulation, of the conceptual contents, which govern all our thoughts. Evidences presented in the work of this dissertation seek to show that the syllogism is marked by the logical-elucidative character of this semantic self-consciousness, because of its expressive role as inseparable from the notion of inference. In the first part of this dissertation, then, the tradition of syllogistics is examined, in which the expression is the main notion. This study is based on the tradition of syllogistics, composed of the Aristotelian school of Campinas, organized by Angioni (2014a), the logical economist Keynes (1906), and the “formalist” schools, represented mainly by the logician Łukasiewicz (1957, 1929/1963) and by Corcoran (1972, 1974, 2009, 2015). The main claims of the Campinas school are analyzed: the non-epistemological, but explanatory, exposition of (scientific) knowledge, in the syllogism, the secondary role of the notion of truth, the priority of the predicative structure, and the suggestion of approaching of the syllogistic to the relevant system of logic. In this analysis, we add the discussion about the reasoning of the epagogic type, important to the practical understanding of the “first principles”. The key points of Keynes are also discussed: the semantic priority of propositional judgment and the explanatory role of deductive inference. The second part of this dissertation discusses the relation between expression, inference and the expressive role of logic, based on the semantic inferentialism of Brandom. In order to discuss this relationship, propaedeutic questions are raised, related to the semantic role of sentences and subsentences (terms and predicates) in language, to different conceptions of logical validity, beyond the truth-functional aspect, to the logical demarcation of symbolic rules, to demarcation of logic, the idea of “formal logic”, and the removal of formal semantics from natural language concern. Next, the theoretical framework of Brandom's semantic inferentialism is presented. In this framework, the idea of philosophical semantics, pragmatisms of the semantic and conceptual type, expressivisms of the rationalist, logical and propositional conceptual type, and the semantically primitive notion of incompatibility come into play. Thus, to those who are interested in the correspondence between ancient logic and modern logic, the work of this dissertation offers a useful contribution, especially to projects of formalization of the syllogistics, which need not appeal against or in favor of a strictly formal approach to logic. (shrink)