Everyday Life Reasoning, Possible Worlds and Cultural Processes

Discussing Faiciuc’s paper, I first tackle the problem of fallacies in deductive reasoning showing how, in a possible world theory, non correct forms of reasoning can be useful strategies for discovery, providing these strategies remain at a hypothesis level. Secondly, everyday reasoning and its specificity in comparison to logical-normative one are analyzed. This topic stresses the notion of interpretation and, in this context, the role of the community and of cultural canons shared by the subject. From this point of view, reasoning does not occur, only, in the brain of a person but in everyday exchanges occurring between individuals and the history of their community.

A Propositional Logic with Relative Identity Connective and a Partial Solution to the Paradox of Analysis

We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one. We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic models. We also show that PLRI can be used to give a partial solution to the paradox of analysis. Presented by Jacek Malinowski     

A Note on Neat Reducts

SC, CA, QA and QEA denote the class of Pinter’s substitution algebras, Tarski’s cylindric algebras, Halmos’ quasi-polyadic and quasi-polyadic equality algebras, respectively. Let . and . We show that the class of n dimensional neat reducts of algebras in K _m is not elementary. This solves a problem in [2]. Also our result generalizes results proved in [1] and [2]. Presented by Robert Goldblatt     

Uniform Interpolation and Propositional Quantifiers in Modal Logics

We investigate uniform interpolants in propositional modal logics from the proof-theoretical point of view. Our approach is adopted from Pitts’ proof of uniform interpolationin intuitionistic propositional logic [15]. The method is based on a simulation of certain quantifiers ranging over propositional variables and uses a terminating sequent calculus for which structural rules are admissible. We shall present such a proof of the uniform interpolation theorem for normal modal logics K and T. It provides an explicit algorithm constructing the interpolants. Presented by Heinrich Wansing     

Superassertibility and the Equivalence Schema: A Dilemma for Wright’s Antirealist

Crispin Wright champions the notion of superassertibility as providing a truth predicate that is congenial to antirealists in many debates in that it satisfies relevant platitudes concerning truth and does so in a very minimal way. He motivates such a claim by arguing that superassertibility can satisfy the equivalence schema: it is superassertible that P if and only if P. I argue that Wright’s attempted proof that superassertibility can satisfy this schema is unsuccessful, because it requires a premise that has not been properly motivated and is prima facie implausible. I further argue that, even if the dubious premise is accepted, the resulting proof is intuitionistically invalid. This is problematic, because a proponent of superassertibility as a truth predicate has independent reasons to affect a logical revision in the direction of intuitionism. The resulting dilemma suggests that superassertibility may not be an adequate truth candidate for any significant ranges of discourse. Cambridge, MA: Harvard University Press, 1992     

A logical expression of reasoning

A non-monotonic logic, the Logic of Plausible Reasoning (LPR), capable of coping with the demands of what we call complex reasoning, is introduced. It is argued that creative complex reasoning is the way of reasoning required in many instances of scientific thought, professional practice and common life decision taking. For managing the simultaneous consideration of multiple scenarios inherent in these activities, two new modalities, weak and strong plausibility, are introduced as part of the Logic of Plausible Deduction (LPD), a deductive logic specially designed to serve as the monotonic support for LPR. Axiomatics and semantics for LPD, together with a completeness proof, are provided. Once LPD has been given, LPR may be defined via a concept of extension over LPD. Although the construction of LPR extensions is first presented in standard style, for the sake of comparison with existing non-monotonic formalisms, alternative more elegant and intuitive ways for constructing non-monotonic LPR extensions are also given and proofs of their equivalence are presented.     

Dynamic doxastic logic: why,how, and where to?

We investigate the research programme of dynamic doxastic logic (DDL) and analyze its underlying methodology. The Ramsey test for conditionals is used to characterize the logical and philosophical differences between two paradigmatic systems, AGM and KGM, which we develop and compare axiomatically and semantically. The importance of Gärdenfors’s impossibility result on the Ramsey test is highlighted by a comparison with Arrow’s impossibility result on social choice. We end with an outlook on the prospects and the future of DDL.     

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.