Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
IGPL
1998
97views more  IGPL 1998»
10 years 11 months ago
Towards Structurally-Free Theorem Proving
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
Marcelo Finger
IGPL
2002
91views more  IGPL 2002»
10 years 11 months ago
The Unrestricted Combination of Temporal Logic Systems
This paper generalises and complements the work on combining temporal logics started by Finger and Gabbay [11, 10]. We present proofs of transference of soundness, completeness an...
Marcelo Finger, M. Angela Weiss
LOGCOM
2000
93views more  LOGCOM 2000»
10 years 11 months ago
The product of converse PDL and polymodal K
The product of two modal logics L1 and L2 is the modal logic determined by the class of frames of the form FG such that F and G validate L1 and L2, respectively. This paper proves...
Frank Wolter
ENTCS
2002
152views more  ENTCS 2002»
10 years 11 months ago
Abstract Logics as Dialgebras
Logics as Dialgebras Alessandra Palmigiano Departament de L`ogica, Hist`oria i Filosofia de la Ci`encia, Universitat de Barcelona The aim of this report is to propose a line of re...
Alessandra Palmigiano
IGPL
2000
129views more  IGPL 2000»
10 years 11 months ago
Embeddings of Propositional Monomodal Logics
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced,...
Evgeni E. Zolin
EATCS
2000
108views more  EATCS 2000»
10 years 11 months ago
The Underlying Logic of Hoare Logic
Formulas of Hoare logic are asserted programs where is a program and , are assertions. The language of programs varies; in the survey [Apt 1980], one finds the language of wh...
Andreas Blass, Yuri Gurevich
CORR
2000
Springer
132views Education» more  CORR 2000»
10 years 11 months ago
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of epistemological and semantic foundations for autoepistemic and default logics, two leading formalisms in nonmonotonic reasoning. We develop a general seman...
Marc Denecker, Victor W. Marek, Miroslaw Truszczyn...
APAL
2004
87views more  APAL 2004»
10 years 11 months ago
Expressive equivalence of least and inflationary fixed-point logic
We study the relationship between least and inflationary fixed-point logic. In 1986, Gurevich and Shelah proved that in the restriction to finite structures, the two logics have t...
Stephan Kreutzer
LOGCOM
2007
89views more  LOGCOM 2007»
10 years 11 months ago
Anytime Approximations of Classical Logic from Above
In this paper we present s1, a family of logics that is useful to disprove propositional formulas by means of an anytime approximation process. The systems follows the paradigm of...
Marcelo Finger, Renata Wassermann
ACS
2002
10 years 11 months ago
Categorical Abstract Algebraic Logic: Algebraizable Institutions
cal Abstract Algebraic Logic: Algebraizable Institutions To Don Pigozzi this work is dedicated GEORGE VOUTSADAKIS Department of Mathematics, Iowa State University, Ames, IA 50011 U...
George Voutsadakis
books