On the proof of Solovay's theorem

Solovay's 1976 completeness result for modal provability logic employs the recursion theorem in its proof. It is shown that the uses of the recursion theorem can in this proof be replaced by the diagonalization lemma for arithmetic and that, in effect, the proof neatly fits the framework of another, enriched, system of modal logic (the so-called Rosser logic of Gauspari-Solovay, 1979) so that any arithmetical system for which this logic is sound is strong enough to carry out the proof, in particular I₀+EXP. The method is adapted to obtain a similar completeness result for the Rosser logic.     

Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation

Constructive logic with Nelson negation is an extension of the intuitionistic logic with a special type of negation expressing some features of constructive falsity and refutation by counterexample. In this paper we generalize this logic weakening maximally the underlying intuitionistic negation. The resulting system, called subminimal logic with Nelson negation, is studied by means of a kind of algebras called generalized N-lattices. We show that generalized N-lattices admit representation formalizing the intuitive idea of refutation by means of counterexamples giving in this way a counterexample semantics of the logic in question and some of its natural extensions. Among the extensions which are near to the intuitionistic logic are the minimal logic with Nelson negation which is an extension of the Johansson's minimal logic with Nelson negation and its in a sense dual version — the co-minimal logic with Nelson negation. Among the extensions near to the classical logic are the well known 3-valued logic of Lukasiewicz, two 12-valued logics and one 48-valued logic. Standard questions for all these logics — decidability, Kripke-style semantics, complete axiomatizability, conservativeness are studied. At the end of the paper extensions based on a new connective of self-dual conjunction and an analog of the Lukasiewicz middle value ½ have also been considered.     

Does Science Influence the Logic we Ought to Use: A Reflection on the Quantum Logic Controversy

In this article I argue that there is a sense in which logic is empirical, and hence open to influence from science. One of the roles of logic is the modelling and extending of natural language reasoning. It does so by providing a formal system which succeeds in modelling the structure of a paradigmatic set of our natural language inferences and which then permits us to extend this structure to novel cases with relative ease. In choosing the best system of those that succeed in this, we seek certain virtues of such structures such as simplicity and naturalness (which will be explained). Science can influence logic by bringing us, as in the case of quantum mechanics, to make natural language inferences about new kinds of systems and thereby extend the set of paradigmatic cases that our formal logic ought to model as simply and naturally as possible. This can alter which structures ought to be used to provide semantics for such models. I show why such a revolution could have led us to reject one logic for another through explaining why complex claims about quantum mechanical systems failed to lead us to reject classical logic for quantum logic.     

Logical Foundations and Kant's Principles of Formal Logic

The abstract status of Kant's account of his ‘general logic’ is explained in comparison with Gödel's general definition of a formal logical system and reflections on ‘abstract’ (‘absolute’) concepts. Thereafter, an informal reconstruction of Kant's general logic is given from the aspect of the principles of contradiction, of sufficient reason, and of excluded middle. It is shown that Kant's composition of logic consists in a gradual strengthening of logical principles, starting from a weak principle of contradiction that tolerates a sort of contradictions in predication, and then proceeding to the (constructive) principle of sufficient reason, and to a classical-like logic, which includes the principle of excluded middle. A first-order formalisation is applied to this reconstruction, which reveals implicit modalities in Kant's account of logic, and confirms the implementability of Kant's logic into a sound and complete formal system.     

Curry-Howard Terms for Linear Logic

In this paper we 1. provide a natural deduction system for full first-order linear logic, 2. introduce Curry-Howard-style terms for this version of linear logic, 3. extend the notion of substitution of Curry-Howard terms for term variables, 4. define the reduction rules for the Curry-Howard terms and 5. outline a proof of the strong normalization for the full system of linear logic using a development of Girard's candidates for reducibility, thereby providing an alternative to Girard's proof using proof-nets.     

An Intuitionistic Reformulation of Mally’s Deontic Logic

In 1926, Ernst Mally proposed a number of deontic postulates. He added them as axioms to classical propositional logic. The resulting system was unsatisfactory because it had the consequence that A is the case if and only if it is obligatory that A. We present an intuitionistic reformulation of Mally’s deontic logic. We show that this system does not provide the just-mentioned objectionable theorem while most of the theorems that Mally considered acceptable are still derivable. The resulting system is unacceptable as a deontic logic, but it does make sense as a lax logic in the modern sense of the word.     

Gentzen-Style Axiomatizations for Some Conservative Extensions of Basic Propositional Logic

We introduce two Gentzen-style sequent calculus axiomatizations for conservative extensions of basic propositional logic. Our first axiomatization is an ipmrovement of, in the sense that it has a kind of the subformula property and is a slight modification of. In this system the cut rule is eliminated. The second axiomatization is a classical conservative extension of basic propositional logic. Using these axiomatizations, we prove interpolation theorems for basic propositional logic.     

从逻辑哲学看模糊逻辑的形式化

从逻辑哲学观点看,在“符号化、公理化的模糊逻辑”与非形式化的“人脑使用的模糊逻辑”（苗东升的说法）这两者之间,只是形式模型及其现实原型的关系,决不相互排斥。真正的问题不在于,在现实生活中人脑所使用的实际上行之有效的模糊推理,是否应该和可能符号化、公理化,而是在于如何恰当地进行形式化。笔者采用苏珊·哈克（Susan Haack）的逻辑哲学观点,认为非经典逻辑可划分为扩展逻辑和异常（deviation）逻辑,模糊逻辑归属于异常逻辑。本文以模糊逻辑系统FZ为例,具体分析了虽然经典逻辑中一些较强的公理和推理规则均不成立,但是与之对应的较弱的“合经典的”（well-behaved）公理和推理规则却仍然可以成立,由此导致一系列新奇性质。笔者采用了达·柯斯塔（da Costa）的形式化技巧,它是关于“在虚设不矛盾律成立的前提下”（相应公式可以称为“合经典的”）才能成立的逆否律。当我们撤除了“虚设不矛盾律为前提”的限定,它又重新回到了无条件成立的情况。笔者也推广了玻尔（N.Bohr）和冯·威扎克（von Weizsaecker）关于对应原理的思想,认为作为非经典逻辑的模糊逻辑与经典逻辑之间也应当遵守“对应原理”：经典逻辑是模糊逻辑的前身,模糊逻辑将构成更为普遍的逻辑形式,经典逻辑作为模糊逻辑的极限形式,在局部情况下还保持自身的意义。     

A note on sequent calculi intermediate between LJ and LK

We prove that every finitely axiomatizable extension of Heyting's intuitionistic logic has a corresponding cut-free Gentzen-type formulation. It is shown how one can use this result to find the corresponding normalizable natural deduction system and to give a criterion for separability of considered logic. Obviously, the question how to obtain an effective definition of a sequent calculus which corresponds to a concrete logic remains a separate problem for every logic.     

Modelling simultaneous games in dynamic logic

We make a proposal for formalizing simultaneous games at the abstraction level of player’s powers, combining ideas from dynamic logic of sequential games and concurrent dynamic logic. We prove completeness for a new system of ‘concurrent game logic’ CDGL with respect to finite non-determined games. We also show how this system raises new mathematical issues, and throws light on branching quantifiers and independence-friendly evaluation games for first-order logic.     

Chinese Logic and the Absence of Theoretical Sciences in Ancient China

In this essay, I examine the nature of Chinese logic and Chinese sciences in the history of China. I conclude that Chinese logic is essentially analogical, and that the Chinese did not have theoretical sciences. I then connect these together and explain why the Chinese failed to develop theoretical sciences, even though they enjoyed an advanced civilization and great scientific and technological innovations. This is because a deductive system of logic is necessary for the development of theoretical sciences, and analogical logic cannot provide the deductive connections between a theory and empirical observations required by a theoretical science. This also offers a more satisfactory answer to the long-standing Needham Problem.     

Deontic action logic, atomic boolean algebras and fault-tolerance

We introduce a deontic action logic and its axiomatization. This logic has some useful properties (soundness, completeness, compactness and decidability), extending the properties usually associated with such logics. Though the propositional version of the logic is quite expressive, we augment it with temporal operators, and we outline an axiomatic system for this more expressive framework. An important characteristic of this deontic action logic is that we use boolean combinators on actions, and, because of finiteness restrictions, the generated boolean algebra is atomic, which is a crucial point in proving the completeness of the axiomatic system. As our main goal is to use this logic for reasoning about fault-tolerant systems, we provide a complete example of a simple application, with an attempt at formalization of some concepts usually associated with fault-tolerance.     

Is Hintikka's Logic First-Order?

Jaakko Hintikka has argued that ordinary first-order logic should be replaced byindependence-friendly first-order logic, where essentially branching quantificationcan be represented. One recurring criticism of Hintikka has been that Hintikka'ssupposedly new logic is equivalent to a system of second-order logic, and henceis neither novel nor first-order. A standard reply to this criticism by Hintikka andhis defenders has been to show that given game-theoretic semantics, Hintikka'sbranching quantifiers receive the exact same treatment as the regular first-orderones. We develop a different reply, based around considerations concerning thenature of logic. In particular, we argue that Hintikka's logic is the logic that bestrepresents the language fragment standard first-order logic is meantto represent. Therefore it earns its keep, and is also properly regarded as first-order.     

Gentzen Calculi for the Existence Predicate

We introduce Gentzen calculi for intuitionistic logic extended with an existence predicate. Such a logic was first introduced by Dana Scott, who provided a proof system for it in Hilbert style. We prove that the Gentzen calculus has cut elimination in so far that all cuts can be restricted to very simple ones. Applications of this logic to Skolemization, truth value logics and linear frames are also discussed.     

Aristotle's Prior Analytics and Boole's Laws of Thought

Prior Analytics by the Greek philosopher Aristotle (384?–?322 BCE) and Laws of Thought by the English mathematician George Boole (1815?–?1864) are the two most important surviving original logical works from before the advent of modern logic. This article has a single goal: to compare Aristotle's system with the system that Boole constructed over twenty-two centuries later intending to extend and perfect what Aristotle had started. This comparison merits an article itself. Accordingly, this article does not discuss many other historically and philosophically important aspects of Boole's book, e.g. his confused attempt to apply differential calculus to logic, his misguided effort to make his system of ‘class logic’ serve as a kind of ‘truth-functional logic’, his now almost forgotten foray into probability theory, or his blindness to the fact that a truth-functional combination of equations that follows from a given truth-functional combination of equations need not follow truth-functionally. One of the main conclusions is that Boole's contribution widened logic and changed its nature to such an extent that he fully deserves to share with Aristotle the status of being a founding figure in logic. By setting forth in clear and systematic fashion the basic methods for establishing validity and for establishing invalidity, Aristotle became the founder of logic as formal epistemology. By making the first unmistakable steps toward opening logic to the study of ‘laws of thought’—tautologies and laws such as excluded middle and non-contradiction—Boole became the founder of logic as formal ontology.

… using mathematical methods … has led to more knowledge about logic in one century than had been obtained from the death of Aristotle up to … when Boole's masterpiece was published.     

An evolutionary system for neural logic networks using genetic programming and indirect encoding

Nowadays, intelligent connectionist systems such as artificial neural networks have been proved very powerful in a wide area of applications. Consequently, the ability to interpret their structure was always a desirable feature for experts. In this field, the neural logic networks (NLN) by their definition are able to represent complex human logic and provide knowledge discovery. However, under contemporary methodologies, the training of these networks may often result in non-comprehensible or poorly designed structures. In this work, we propose an evolutionary system that uses current advances in genetic programming that overcome these drawbacks and produces neural logic networks that can be arbitrarily connected and are easily interpretable into expert rules. To accomplish this task, we guide the genetic programming process using a context-free grammar and we encode indirectly the neural logic networks into the genetic programming individuals. We test the proposed system in two problems of medical diagnosis. Our results are examined both in terms of the solution interpretability that can lead in knowledge discovery, and in terms of the achieved accuracy. We draw conclusions about the effectiveness of the system and we propose further research directions.     

The Broadest Necessity

In this paper the logic of broad necessity is explored. Definitions of what it means for one modality to be broader than another are formulated, and it is proven, in the context of higher-order logic, that there is a broadest necessity, settling one of the central questions of this investigation. It is shown, moreover, that it is possible to give a reductive analysis of this necessity in extensional language (using truth functional connectives and quantifiers). This relates more generally to a conjecture that it is not possible to define intensional connectives from extensional notions. This conjecture is formulated precisely in higher-order logic, and concrete cases in which it fails are examined. The paper ends with a discussion of the logic of broad necessity. It is shown that the logic of broad necessity is a normal modal logic between S4 and Triv, and that it is consistent with a natural axiomatic system of higher-order logic that it is exactly S4. Some philosophical reasons to think that the logic of broad necessity does not include the S5 principle are given.     

Negation in the Context of Gaggle Theory

We study an application of gaggle theory to unary negative modal operators. First we treat negation as impossibility and get a minimal logic system Ki that has a perp semantics. Dunn's kite of different negations can be dealt with in the extensions of this basic logic K_i. Next we treat negation as “unnecessity” and use a characteristic semantics for different negations in a kite which is dual to Dunn's original one. K_u is the minimal logic that has a characteristic semantics. We also show that Shramko's falsification logic FL can be incorporated into some extension of this basic logic K_u. Finally, we unite the two basic logics K_i and K_u together to get a negative modal logic K_-, which is dual to the positive modal logic K₊ in [7]. Shramko has suggested an extension of Dunn's kite and also a dual version in [12]. He also suggested combining them into a “united” kite. We give a united semantics for this united kite of negations.     

墨家逻辑推理模式的新解释

墨家是先秦诸多学派之一,墨家逻辑也是中国古代本土逻辑思想的典范之一。墨子及其后学创立了中国思想史上第一个＂以名举实,以辞舒意,以说出故＂的墨家逻辑体系,成为中国古代逻辑思想发展的优秀代表。墨家逻辑的主要推理模式包括：＂辟＂、＂侔＂、＂援＂、＂推＂等。墨家逻辑思想的研究开启了中国逻辑思想研究的先河,墨家逻辑思想研究是中国逻辑思想研究的核心内容之一。国际逻辑学界对作为非印—欧语言系统的中国逻辑的关注,显示了中国逻辑独立存在的价值。今天的中国逻辑思想研究处于现代逻辑发展与中国现代文化发展的交汇点上,需要我们从逻辑和中国文化的角度来研究中国逻辑思想。用逻辑的一般特性来分析墨家逻辑,依据工具性、形式性和有效性这三个方面,是解释墨家逻辑的一个新角度。     

存在图的逻辑地位——批评与回应

存在图是继欧拉图、文恩图和皮尔士一文恩图之后的又一种逻辑图。逻辑图是指用于表示命题和推理的二维图形。然而由于存在图之前的逻辑图在表达能力上的缺陷以及现代数理逻辑的成功,长期以来存在图并未引起人们的关注。直到近来计算机表示的图示推理发展起来以后人们才认识到它的重要性,并把它作为一种图式逻辑纳入了哲学逻辑的范畴。人们对存在图逻辑地位的认可经历了一个复杂的过程。存在图在被认可道路上遇到了逻辑系统身份、推理效率和阐述的精确性三个问题,随着这三个问题的解决,人们逐渐认可了存在图的逻辑地位。