A First Order Nonmonotonic Extension of Constructive Logic

Certain extensions of Nelson's constructive logic N with strong negation have recently become important in arti.cial intelligence and nonmonotonic reasoning, since they yield a logical foundation for answer set programming (ASP). In this paper we look at some extensions of Nelson's .rst-order logic as a basis for de.ning nonmonotonic inference relations that underlie the answer set programming semantics. The extensions we consider are those based on 2-element, here-and-there Kripke frames. In particular, we prove completeness for .rst-order here-and-there logics, and their minimal strong negation extensions, for both constant and varying domains. We choose the constant domain version, which we denote by QN^c₅, as a basis for de.ning a .rst-order nonmonotonic extension called equilibrium logic. We establish several metatheoretic properties of QN^c₅, including Skolem forms and Herbrand theorems and Interpolation, and show that the .rst-oder version of equilibrium logic can be used as a foundation for answer set inference.     

Socratic Proofs and Paraconsistency: A Case Study

This paper develops a new proof method for two propositional paraconsistent logics: the propositional part of Batens' weak paraconsistent logic CLuN and Schütte's maximally paraconsistent logic Φ_v. Proofs are de.ned as certain sequences of questions. The method is grounded in Inferential Erotetic Logic.     

Using Syllogistics to Teach Metalogic

This article describes a specific pedagogical context for an advanced logic course and presents a strategy that might facilitate students’ transition from the object‐theoretical to the metatheoretical perspective on logic. The pedagogical context consists of philosophy students who in general have had little training in logic, except for a thorough introduction to syllogistics. The teaching strategy tries to exploit this knowledge of syllogistics, by emphasizing the analogies between ideas from metalogic and ideas from syllogistics, such as existential import, the distinction between contradictories and contraries, and the square of opposition. This strategy helps to improve students’ understanding of metalogic, because it allows the students to integrate these new ideas with their previously acquired knowledge of syllogistics.     

子图问题学习对几何解题迁移的影响

将一个图形（称为母图）的若干条线段删除后得到的图形叫做母图的子图。运用实验方法探讨了子图结构学习和子图变式学习对解决问题的迁移效果。结果表明：子图结构学习仅对解决“图形结构相同、逻辑结构相同”问题有明显迁移作用;子图变式学习对解决“图形结构相同、逻辑结构相同”没有明显迁移作用,对“图形结构相似、逻辑结构相同”、“图形结构相同、逻辑结构相似”以及“图形结构相似、逻辑结构相似”四类问题均有明显迁移作用。     

Hilbert,logicism, and mathematical existence

David Hilbert’s early foundational views, especially those corresponding to the 1890s, are analysed here. I consider strong evidence for the fact that Hilbert was a logicist at that time, following upon Dedekind’s footsteps in his understanding of pure mathematics. This insight makes it possible to throw new light on the evolution of Hilbert’s foundational ideas, including his early contributions to the foundations of geometry and the real number system. The context of Dedekind-style logicism makes it possible to offer a new analysis of the emergence of Hilbert’s famous ideas on mathematical existence, now seen as a revision of basic principles of the “naive logic” of sets. At the same time, careful scrutiny of his published and unpublished work around the turn of the century uncovers deep differences between his ideas about consistency proofs before and after 1904. Along the way, we cover topics such as the role of sets and of the dichotomic conception of set theory in Hilbert’s early axiomatics, and offer detailed analyses of Hilbert’s paradox and of his completeness axiom (Vollständigkeitsaxiom).     

General information in relevant logic

This paper sets out a philosophical interpretation of the model theory of Mares and Goldblatt (The Journal of Symbolic Logic 71, 2006). This interpretation distinguishes between truth conditions and information conditions. Whereas the usual Tarskian truth condition holds for universally quantified statements, their information condition is quite different. The information condition utilizes general propositions. The present paper gives a philosophical explanation of general propositions and argues that these are needed to give an adequate theory of general information.     

On Permutation in Simplified Semantics

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J Philos Logic 22(5):481–511, 1993) concerning the modelling conditions for the axioms of assertion A → ((A → B) → B) (there called c6) and permutation (A → (B → C)) → (B → (A → C)) (there called c7). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose two different corrections.