closure algebras
Recently Published Documents


TOTAL DOCUMENTS

27
(FIVE YEARS 0)

H-INDEX

5
(FIVE YEARS 0)

10.29007/nptc ◽  
2018 ◽  
Author(s):  
Peter Jipsen

We show how to implement an effective decision procedure to check if a propositional Basic Logic formula is a tautology. For a formula with $n$ variables, the procedure consists of a translation, depending on $n$, from Basic Logic to the language of Satisfiability Modulo Theories SMT-LIB2 using the theory of quantifier free linear real arithmetic. Many efficient SMT-solvers exist to decide formulas in the SMT-LIB2 language. We also study finitely generated varieties of Basic Logic (BL-)algebras and give a description of the lattice of these varieties. Extensions to finitely generated varieties of Generalized BL-algebras are discussed, and a simple connection between finite GBL-algebras and finite closure algebras is noted.


2007 ◽  
Vol 58 (1) ◽  
pp. 1-34 ◽  
Author(s):  
Guram Bezhanishvili ◽  
Ray Mines ◽  
Patrick J. Morandi

2002 ◽  
Vol 72 (2) ◽  
pp. 181-198 ◽  
Author(s):  
M. Abad ◽  
J. P. Díaz Varela

AbstractIn this paper, the variety of three-valued closure algebras, that is, closure algebras with the property that the open elements from a three-valued Heyting algebra, is investigated. Particularly, the structure of the finitely generated free objects in this variety is determined.


2002 ◽  
Vol 67 (1) ◽  
pp. 397-408 ◽  
Author(s):  
Larisa Maksimova

AbstractWe consider the problem of recognizing important properties of logical calculi and find complexity bounds for some decidable properties. For a given logical system L, a property P of logical calculi is called decidable over L if there is an algorithm which for any finite set Ax of new axiom schemes decides whether the calculus L + Ax has the property P or not. In [11] the complexity of tabularity, pre-tabularity. and interpolation problems over the intuitionistic logic Int and over modal logic S4 was studied, also we found the complexity of amalgamation problems in varieties of Heyting algebras and closure algebras.In the present paper we deal with positive calculi. We prove NP-completeness of tabularity, DP-hardness of pretabularity and PSPACE-completeness of interpolation problem over Int+. In addition to above-mentioned properties, we consider Beth's definability properties. Also we improve some complexity bounds for properties of superintuitionistic calculi.


2001 ◽  
Vol 108 (1-3) ◽  
pp. 137-152
Author(s):  
J.P. Dı́az Varela
Keyword(s):  

1992 ◽  
Vol 25 (3) ◽  
pp. 205-219 ◽  
Author(s):  
G. Hansoul ◽  
L. Vrancken-Mawet
Keyword(s):  

1986 ◽  
Vol 51 (4) ◽  
pp. 899-906 ◽  
Author(s):  
J. Donald Monk

One of the most extensive parts of Tarski's contributions to logic is his work on the algebraization of the subject. His work here involves Boolean algebras, relation algebras, cylindric algebras, Boolean algebras with operators, Brouwerian algebras, and closure algebras. The last two are less developed in his work, although his contributions are basic to other work in those subjects. At any rate, not being conversant with the latest developments in those fields, we shall concentrate on an exposition of Tarski's work in the first four areas, trying to put them in the perspective of present-day developments.For useful comments, criticisms, and suggestions, the author is indebted to Steven Givant, Leon Henkin, Wilfrid Hodges, Bjarni Jónsson, Roger Lyndon, and Robert Vaught.


1981 ◽  
Vol 31 (4) ◽  
pp. 385-389
Author(s):  
Graham J. Logan

AbstractThis paper discusses two notions, developed independently and both termed “cocompactness”. The first arises in the area of topology, where J. de Groot and others have studied spaces which are, in a certain sense, complementary to a given space. If the given space is compact then the complementary spaces are said to be cocompact. The second concept arises in the area of logic and general algebra. Loosely speaking a logic is compact if every inconsistent set of formulas has a finite inconsistent subset. This notion of compactness may be generalized to any closure algebra and the use of the term “cocompactness” to describe the generalization was suggested to the author by Dr. R. A. Bull.It is shown here that topological and algebraic cocompactness are related in the following ways. Firstly, if a closure algebra is algebraically cocompact then its dual space is topologjcally cocompact, and conditions may be given for the implication to be reversible.3 Furthermore any cocompact topological space may be represented as the continuous 1-1 image of the dual space of a cocompact closure algebra. A final result relates another class of closure algebras with those topological spaces which are compact.


Sign in / Sign up

Export Citation Format

Share Document