Infinitary Action Logic: Complexity, Models and Grammars

Action logic of Pratt [21] can be presented as Full Lambek Calculus FL [14, 17] enriched with Kleene star *; it is equivalent to the equational theory of residuated Kleene algebras (lattices). Some results on axiom systems, complexity and models of this logic were obtained in [4, 3, 18]. Here we prove a stronger form of *-elimination for the logic of *-continuous action lattices and the –completeness of the equational theories of action lattices of subsets of a finite monoid and action lattices of binary relations on a finite universe. We also discuss possible applications in linguistics. Presented by Jacek Malinowski     

Constructive Logic, Truth and Warranted Assertability

Shapiro and Taschek have argued that simply using intuitionistic logic and its Heyting semantics, one can show that there are no gaps in warranted assertability. That is, given that a discourse is faithfully modelled using Heyting's semantics for the logical constants, then if a statement S is not warrantedly assertable, its negation ^∼ S is. Tennant has argued for this conclusion on similar grounds. I show that these arguments fail, albeit in illuminating ways. An appeal to constructive logic does not commit one to this strong epistemological thesis, but appeals to semantics of intuitionistic logic none the less do give us certain conclusions about the connections between warranted assertability and truth.     

Truth Values and Proof Theory

I present an account of truth values for classical logic, intuitionistic logic, and the modal logic S5, in which truth values are not a fundamental category from which the logic is defined, but rather, an idealisation of more fundamental logical features in the proof theory for each system. The result is not a new set of semantic structures, but a new understanding of how the existing semantic structures may be understood in terms of a more fundamental notion of logical consequence.     

Modal Logic,Truth, and the Master Modality

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a so-called master modality. Moreover, we explore a connection between the master modality and hybrid logic: We show that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic.     

Higher-Order Logic and Disquotational Truth

Journal of Philosophical Logic - Truth predicates are widely believed to be capable of serving a certain logical or quasi-logical function. There is little consensus, however, on the exact nature...     

An Interpolation Theorem for First Order Logic with Infinitary Predicates

An interpolation Theorem is proved for first order logic withinfinitary predicates. Our proof is algebraic via cylindricalgebras.¹     

The Logic of Pragmatic Truth

The mathematical concept of pragmatic truth, first introduced in Mikenberg, da Costa and Chuaqui (1986), has received in the last few years several applications in logic and the philosophy of science. In this paper, we study the logic of pragmatic truth, and show that there are important connections between this logic, modal logic and, in particular, Jaskowski's discussive logic. In order to do so, two systems are put forward so that the notions of pragmatic validity and pragmatic truth can be accommodated. One of the main results of this paper is that the logic of pragmatic truth is paraconsistent. The philosophical import of this result, which justifies the application of pragmatic truth to inconsistent settings, is also discussed.     

Epistemic Friction: Reflections on Knowledge, Truth, and Logic

Knowledge requires both freedom and friction. Freedom to set up our epistemic goals, choose the subject matter of our investigations, espouse cognitive norms, design research programs, etc., and friction (constraint) coming from two directions: the object or target of our investigation, i.e., the world in a broad sense, and our mind as the sum total of constraints involving the knower. My goal is to investigate the problem of epistemic friction, the relation between epistemic friction and freedom, the viability of foundationalism as a solution to the problem of friction, an alternative solution in the form of a neo-Quinean model, and the possibility of solving the problem of friction as it applies to logic and the philosophy of logic within that model.     

Proof Analysis in Modal Logic

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel–Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.     

Truth versus testability in Quantum Logic

We forward an epistemological perspective regarding non-classical logics which restores the universality of logic in accordance with the thesis of global pluralism. In this perspective every non-classical truth-theory is actually a theory of some metalinguistic concept which does not coincide with the concept of truth (described by Tarski's truth theory). We intend to apply this point of view to Quantum Logic (QL) in order to prove that its structure properties derive from properties of the metalinguistic concept of testability in Quantum Physics. To this end we construct a classical language L _cand endow it with a classical effective interpretation which is partially inspired by the Ludwig approach to the foundations of Quantum Mechanics. Then we select two subsets of formulas in L _cwhich can be considered testable because of their interpretation and we show that these subsets have the structure properties of Quantum Logics because of Quantum Mechanical axioms, as desired. Finally we comment on some relevant consequences of our approach (in particular, the fact that no non-classical logic is strictly needed in Quantum Physics).     

Contraction,Infinitary Quantifiers,and Omega Paradoxes

Our main goal is to investigate whether the infinitary rules for the quantifiers endorsed by Elia Zardini in a recent paper are plausible. First, we will argue that they are problematic in several ways, especially due to their infinitary features. Secondly, we will show that even if these worries are somehow dealt with, there is another serious issue with them. They produce a truth-theoretic paradox that does not involve the structural rules of contraction.     

Proof Theory of Paraconsistent Quantum Logic

Paraconsistent quantum logic, a hybrid of minimal quantum logic and paraconsistent four-valued logic, is introduced as Gentzen-type sequent calculi, and the cut-elimination theorems for these calculi are proved. This logic is shown to be decidable through the use of these calculi. A first-order extension of this logic is also shown to be decidable. The relationship between minimal quantum logic and paraconsistent four-valued logic is clarified, and a survey of existing Gentzen-type sequent calculi for these logics and their close relatives is addressed.     

Proof Theory for Functional Modal Logic

We present some proof-theoretic results for the normal modal logic whose characteristic axiom is \(\mathord {\sim }\mathord {\Box }A\equiv \mathord {\Box }\mathord {\sim }A\). We present a sequent system for this logic and a hypersequent system for its first-order form and show that these are equivalent to Hilbert-style axiomatizations. We show that the question of validity for these logics reduces to that of classical tautologyhood and first-order logical truth, respectively. We close by proving equivalences with a Fitch-style proof system for revision theory.     

A Proof System for Classical Logic

An operation on inferential rules, called H-operation, is used to minimize the axiom basis for classical logic.     

数学证明:数学真理的来源?

对于一个数学实在论者来说,一个特别急迫的任务是回答数学证明是如何建立起关于数学对象的真理性问题。本文批判性考察由Resnik所提出的认知解答,指出了其中不成立的前提。并且在此基础上提出我们自己的解答,它是基于由Oliver．G所提倡的方面(aspects)概念而来的社会——论辩方案。