Cut-Elimination and a Permutation-Free Sequent Calculus for Intuitionistic Logic

We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are in 1-1 correspondence with the normal natural deduction proofs of intuitionistic logic. We present a simple proof of Herbelin's strong cut-elimination theorem for the calculus, using the recursive path ordering theorem of Dershowitz.     

Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere

A hybrid logic is obtained by adding to an ordinary modal logic further expressive power in the form of a second sort of propositional symbols called nominals and by adding so-called satisfaction operators. In this paper we consider hybridized versions of S5 (“the logic of everywhere”) and the modal logic of inequality (“the logic of elsewhere”). We give natural deduction systems for the logics and we prove functional completeness results.     

The Relation between Formal and Informal Logic

The issue of the relationship between formal and informal logic depends strongly on how one understands these two designations. While there is very little disagreement about the nature of formal logic, the same is not true regarding informal logic, which is understood in various (often incompatible) ways by various thinkers. After reviewing some of the more prominent conceptions of informal logic, I will present my own, defend it and then show how informal logic, so understood, is complementary to formal logic.     

Historical Origins of Argumentum ad Consequentiam

What are the historical origins of the argumentum ad consequentiam, the argument from (or literally, to) consequences, sometimes featured as an informal fallacy in logic textbooks? As shown in this paper, knowledge of the argument can be traced back to Aristotle (who did not treat it as a fallacy, but as a reasonable argument). And this type of argument shows a spotty history of recognition in logic texts and manuals over the centuries. But how it got into the modern logic textbooks as a fallacy remains somewhat obscure. Its modern genesis is traced to the logic text of James McCosh (1879).     

Scientific Understanding and Mathematical Abstraction

This paper argues for two related theses. The first is that mathematical abstraction can play an important role in shaping the way we think about and hence understand certain phenomena, an enterprise that extends well beyond simply representing those phenomena for the purpose of calculating/predicting their behaviour. The second is that much of our contemporary understanding and interpretation of natural selection has resulted from the way it has been described in the context of statistics and mathematics. I argue for these claims by tracing attempts to understand the basis of natural selection from its early formulation as a statistical theory to its later development by R.A. Fisher, one of the founders of modern population genetics. Not only did these developments put natural selection of a firm theoretical foundation but its mathematization changed the way it was understood as a biological process. Instead of simply clarifying its status, mathematical techniques were responsible for redefining or reconceptualising selection. As a corollary I show how a highly idealised mathematical law that seemingly fails to describe any concrete system can nevertheless contain a great deal of accurate information that can enhance our understanding far beyond simply predictive capabilities.

Some Embedding Theorems for Conditional Logic

We prove some embedding theorems for classical conditional logic, covering ‘finitely cumulative’ logics, ‘preferential’ logics and what we call ‘semi-monotonic’ logics. Technical tools called ‘partial frames’ and ‘frame morphisms’ in the context of neighborhood semantics are used in the proof.     

脑的逻辑功能的核磁共振成像及其哲学意义

国际上关于逻辑对应的脑物理特征的功能核磁共振成像（fMRI）研究的主要成就在于：建立了高级精神活动和低级神经活动的关联关系的试验方法;提出了高级精神活动的（判断和推理）神经计算模型建立方法。这些研究的实验结果表明,逻辑与神经活动具有确定性的对应关系,它证明了强人工智能的观点：导致意识的可验证的实体（或者称为“意识关联物”）就是意识本身。意识的运行方式是可计算的,思维的本质可以还原为机械性的操作步骤,人工智能和人的天然智能在本质上并无二致。     

Logic Games are Complete for Game Logics

Game logics describe general games through powers of players for forcing outcomes. In particular, they encode an algebra of sequential game operations such as choice, dual and composition. Logic games are special games for specific purposes such as proof or semantical evaluation for first-order or modal languages. We show that the general algebra of game operations coincides with that over just logical evaluation games, whence the latter are quite general after all. The main tool in proving this is a representation of arbitrary games as modal or first-order evaluation games. We probe how far our analysis extends to product operations on games. We also discuss some more general consequences of this new perspective for standard logic.     

Logic Without Contraction as Based on Inclusion and Unrestricted Abstraction

On the one hand, the absence of contraction is a safeguard against the logical (property theoretic) paradoxes; but on the other hand, it also disables inductive and recursive definitions, in its most basic form the definition of the series of natural numbers, for instance. The reason for this is simply that the effectiveness of a recursion clause depends on its being available after application, something that is usually assured by contraction. This paper presents a way of overcoming this problem within the framework of a logic based on inclusion and unrestricted abstraction, without any form of extensionality. This revised version was published online in June 2006 with corrections to the Cover Date.     

A Temporal Logic for Sortals

With the past and future tense propositional operators in its syntax, a formal logical system for sortal quantifiers, sortal identity and (second order) quantification over sortal concepts is formulated. A completeness proof for the system is constructed and its absolute consistency proved. The completeness proof is given relative to a notion of logical validity provided by an intensional semantic system, which assumes an approach to sortals from a modern form of conceptualism.     

ORGANON The Web Tutor for Basic Logic Courses

We would like to introduce the web tutor ORGANON, which aimsto support basic logic courses at the University of West Bohemiain Pilsen (Czech Republic). The application was designed tofulfill two requirements. Firstly, it should help students duringtheir study to practice exercises on their own (providing permanentcontrol during students’ practicing exercises as wellas answering students’ questions immediately as they arise).Secondly, it should reduce teachers’ burden (diminishingthe amount of consultations as well as administrating students’homework including correcting and grading). The tutor is availableat http://kfi.zcu.cz/lide/dostalova/organon.     

A New Representation Theorem for Contranegative Deontic Logic

The logic of an ought operator O is contranegative with respect to an underlying preference relation if it satisfies the property Op & (¬p)(¬q) Oq. Here the condition that is interpolative ((p (pq) q) (q (pq) p)) is shown to be necessary and sufficient for all -contranegative preference relations to satisfy the plausible deontic postulates agglomeration (Op & OqO(p&q)) and disjunctive division (O(p&q) Op Oq).     

An Axiomatisation for the Multi-modal Logic of Knowledge and Linear Time LTK

The paper aims at providing the multi-modal propositional logicLTK with a sound and complete axiomatisation. This logic combinestemporal and epistemic operators and focuses on m odeling thebehaviour of a set of agents operating in a system on the backgroundof a temporal framework. Time is represented as linear and discrete,whereas knowledge is modeled as an S₅-like modality. A furthermodal operator intended to represent environment knowledge isadded to the system in order to achieve the expressive powersufficient to describe the piece of information available tothe agents at each moment in the flow of time.     

Probability Semantics for Quantifier Logic

By supplying propositional calculus with a probability semantics we showed, in our 1996, that finite stochastic problems can be treated by logic-theoretic means equally as well as by the usual set-theoretic ones. In the present paper we continue the investigation to further the use of logical notions in probability theory. It is shown that quantifier logic, when supplied with a probability semantics, is capable of treating stochastic problems involving countably many trials.     

A Logic for Information Systems

A conception of an information system has been introduced by Pawlak. The study has been continued in works of Pawlak and Orlowska and in works of Vakarelov. They had proposed some basic relations and had constructed a formal system of a modal logic that describes the relations and some of their Boolean combinations. Our work is devoted to a generalization of this approach. A class of relation systems and a complete calculus construction method for these systems are proposed. As a corollary of our main result, our paper contains a solution of a Vakarelov's problem: how to construct a formal system that describes all the Boolean combinations of the basic relations.     

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.