This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state (...) of the art in the area. (shrink)

The Joint International Conference on Logic Programming, sponsored by the Association for Logic Programming, is a major forum for presentations of research, applications, and implementations in this important area of computer science. Logic programming is one of the most promising steps toward declarative programming and forms the theoretical basis of the programming language Prolog and its various extensions. Logic programming is also fundamental to work in artificial intelligence, where it has been used for nonmonotonic and commonsense reasoning, expert systems implementation, (...) deductive databases, and applications such as computer-aided manufacturing. Krzysztof R. Apt is project leader at the Centre for Mathematics and Computer Science in Amsterdam and part-time Professor in Computer Science at the University of Amsterdam. Topics covered: Theory Foundations. Programming Languages. Implementation. Programming Methodologies and Tools. Applications. Deductive Databases. Artificial Intelligence. Parallelism. (shrink)

The First International Workshop brings together researchers from the theoretical ends of the logic programming and artificial intelligence communities to discuss their mutual interests. Logic programming deals with the use of models of mathematical logic as a way of programming computers, where theoretical AI deals with abstract issues in modeling and representing human knowledge and beliefs. One common ground is nonmonotonic reasoning, a family of logics that includes room for the kinds of variations that can be found in human reasoning. (...) Topics covered: Stable Semantics. Default Logic. AutoEpistemic Logic. Truth Maintenance Systems. Implementation Issues. Diagnosis. Applications. Inheritance Reasoning. Logics of Belief. Inconsistency and Non-Monotonicity. (shrink)

Logics of significance have been proposed in an attempt to overcome the shortcomings of classical logic as a model of reasoning in the presence of nonsignificant (e.g., meaningless, ill-formed, unverifiable) sentences. Many-valued logicians have addressed this problem by introducing logics with infectious truth values. Cases in point are the weak Kleene logics B3 (paracomplete weak Kleene logic) and PWK (paraconsistent weak Kleene logic). Over time, it has become clear that the valid entailments of these significance logics obey variable inclusion patterns (...) that link them to other, usually better known, logics—such patterns, however, allow for disturbing exceptions. Logics of pure (left or right) variable inclusion have been introduced with an eye to removing these exceptions. In this paper, we consider the pure left variable inclusion companion of classical logic and give a complete description of its subclassical extensions. We also provide relative axiomatizations and characteristic (sets of) matrices for each one of these extensions, as well as syntactic descriptions (in terms of variable inclusion criteria) for the valid entailments of some of them, and determine in each case the algebra reducts of the Suszko-reduced matrix models. (shrink)

We analyze the variety of A. Monteiro’s tetravalent modal algebras under the perspective of two logic systems naturally associated to it. Taking profit of the contrapositive implication introduced by A. Figallo and P. Landini, sound and complete Hilbert-style calculi for these logics are presented.

This paper studies a class of infinite-valued predicate logics. A sufficient condition for axiomatizability of logics from that class is given.

This composition text focuses on argument and persuasion using examples, exercises, readings, and writing assignments. The text guides students through developing a thesis, finding and organizing evidence, and writing and revising several different types of argumentative papers. The second edition de-emphasizes the language of formal logic, and all the readings, examples, and exercises have been updated. Additional coverage has been given to refutation. Widely used in both advanced composition and second semester freshman courses.

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or trans-world identity). The paper (...) also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)

An involutive micanorm-based logic with a weak form of associativity is introduced and its finite standard completeness is addressed. More precisely, we first introduce the logic WAuIBUL as a [0, u]-continuous wau-uninorm analogue of the involutive logic IBUL. We next discuss its algebraic semantics. We then introduce involutive wau-uninorms as involutive uninorms with weak u-associativity in place of associativity and deal with related properties. We last provide finite strong standard completeness for WAuIBUL using a construction of Yang-style. -/- 약한 형식의 (...) 결합 원리를 만족하는 누승적인 미카놈에 기반한 논리 체계를 소개하고 그 체계의 유한 표준 완전성을 다룬다. 보다 구체적으로 논리 체계 WAuIBUL을 누승적 유니놈 논리 IUML의 [0, u]-연속인 wau-유니놈 일반화로 먼저 소개한다. 그리고 이 체계의 대수적 완전성을 다룬다. 다음으로 결합 원리 대신에 약한 u-결합 원리를 만족하는 누승적 유니놈으로 누승적 wau-유니놈을 소개하고 그 성질을 다룬다. 마지막으로 유한 집합 위에서 WAuIBUL의 표준 완전성을 보인다. (shrink)

A study in the logic of theory change, examining the properties of maxichoice contraction and revision operations.

Together, Models and Computability and its sister volume Sets and Proofs will provide readers with a comprehensive guide to the current state of mathematical logic. All the authors are leaders in their fields and are drawn from the invited speakers at 'Logic Colloquium '97' (the major international meeting of the Association of Symbolic Logic). It is expected that the breadth and timeliness of these two volumes will prove an invaluable and unique resource for specialists, post-graduate researchers, and the informed and (...) interested nonspecialist. (shrink)

이 논문은 약한 결합 형식을 갖는 두 준선형 논리와 그것들의 누승적 확장 논리 사이의 동치 관계와 이러한 논리 체계 중 한 논리 체계의 표준 완전성을 다룬다. 좀더 구체적으로 먼저 논리 IWAUBUL을 약한 결합 형태를 갖는 준선형 논리 WAUBUL의 누승적 확장으로 소개하고 이 체계의 대수적 의미론을 다룬다. 특히 우리는 IWAUBUL이 WAUIBUL 체계와 동치라는 것을 보인다. 다음으로 우리는 관련된 약한 결합 힝식을 만족하는 누승적 미카놈을 소개한다. 마지막으로 이 논리를 위한 대수적 조건들에 바탕을 둔 표준 완전성을 다룬다.

Involutive Stone algebras were introduced by R. Cignoli and M. Sagastume in connection to the theory of $n$-valued Łukasiewicz–Moisil algebras. In this work we focus on the logic that preserves degrees of truth associated to S-algebras named Six. This follows a very general pattern that can be considered for any class of truth structure endowed with an ordering relation, and which intends to exploit many-valuedness focusing on the notion of inference that results from preserving lower bounds of truth values, and (...) hence not only preserving the value $1$. Among other things, we prove that Six is a many-valued logic that can be determined by a finite number of matrices. Besides, we show that Six is a paraconsistent logic. Moreover, we prove that it is a genuine Logic of Formal Inconsistency with a consistency operator that can be defined in terms of the original set of connectives. Finally, we study the proof theory of Six providing a Gentzen calculus for it, which is sound and complete with respect to the logic. (shrink)

When considering m-sequents, it is always possible to obtain an m-sequent calculus VL for every m-valued logic (defined from an arbitrary finite algebra L of cardinality m) following for instance the works of the Vienna Group for Multiple-valued Logics. The Gentzen relations associated with the calculi VL are always finitely equivalential but might not be algebraizable. In this paper we associate an algebraizable 2-Gentzen relation with every sequent calculus VL in a uniform way, provided the original algebra L has a (...) reduct that is a distributive lattice or a pseudocomplemented distributive lattice. We also show that the sentential logic naturally associated with the provable sequents of this algebraizable Gentzen relation is the logic that preserves degrees of truth with respect to the original algebra (in contrast with the more common logic that merely preserves truth). Finally, for some particular logics we obtain 2-sequent calculi that axiomatize the algebraizable Gentzen relations obtained so far. (shrink)