Expansions of Heyting algebras

Size: px
Start display at page:

Download "Expansions of Heyting algebras"

Transcription

1 1 / 16 Expansions of Heyting algebras Christopher Taylor La Trobe University Topology, Algebra, and Categories in Logic Prague, 2017

2 Motivation Congruences on Heyting algebras are determined exactly by filters of the underlying lattice what about algebras with a Heyting algebra reduct? 2 / 16

3 2 / 16 Motivation Congruences on Heyting algebras are determined exactly by filters of the underlying lattice what about algebras with a Heyting algebra reduct? Boolean algebras with operators. If B is a boolean algebra equipped with finitely many (dual normal) operators, i.e., unary operations f 1,..., f n satisfying f i (x y) = f i x f i y, f i 1 = 1,

4 2 / 16 Motivation Congruences on Heyting algebras are determined exactly by filters of the underlying lattice what about algebras with a Heyting algebra reduct? Boolean algebras with operators. If B is a boolean algebra equipped with finitely many (dual normal) operators, i.e., unary operations f 1,..., f n satisfying f i (x y) = f i x f i y, f i 1 = 1, then congruences on B are determined by filters closed under the map dx = f 1 x f 2 x... f n x

5 2 / 16 Motivation Congruences on Heyting algebras are determined exactly by filters of the underlying lattice what about algebras with a Heyting algebra reduct? Boolean algebras with operators. If B is a boolean algebra equipped with finitely many (dual normal) operators, i.e., unary operations f 1,..., f n satisfying f i (x y) = f i x f i y, f i 1 = 1, then congruences on B are determined by filters closed under the map dx = f 1 x f 2 x... f n x Double-Heyting algebras. Double-Heyting algebras have their congruences determined by filters closed under the map dx = (1 x) 0

6 3 / 16 Preliminaries An algebra A = A; M,,,, 0, 1 is an expanded Heyting algebra (EHA) if the reduct A,,,, 0, 1 is a Heyting algebra and M is a set of operations on A.

7 3 / 16 Preliminaries An algebra A = A; M,,,, 0, 1 is an expanded Heyting algebra (EHA) if the reduct A,,,, 0, 1 is a Heyting algebra and M is a set of operations on A. Let x y = x y y x. Recall that if A is a Heyting algebra and F A is a filter, then the binary relation θ(f) = {(x, y) x y F} is a congruence on A.

8 3 / 16 Preliminaries An algebra A = A; M,,,, 0, 1 is an expanded Heyting algebra (EHA) if the reduct A,,,, 0, 1 is a Heyting algebra and M is a set of operations on A. Let x y = x y y x. Recall that if A is a Heyting algebra and F A is a filter, then the binary relation θ(f) = {(x, y) x y F} is a congruence on A. A filter F A is compatible with an n-ary operation f on A if {x i y i i n} F implies f ( x) f ( y) F.

9 3 / 16 Preliminaries An algebra A = A; M,,,, 0, 1 is an expanded Heyting algebra (EHA) if the reduct A,,,, 0, 1 is a Heyting algebra and M is a set of operations on A. Let x y = x y y x. Recall that if A is a Heyting algebra and F A is a filter, then the binary relation θ(f) = {(x, y) x y F} is a congruence on A. A filter F A is compatible with an n-ary operation f on A if {x i y i i n} F implies f ( x) f ( y) F. Theorem If A is an EHA then θ(f) is a congruence on A if and only if F is compatible with f for every f M.

10 4 / 16 Normal filter terms Any unquantified A from now on is a fixed but arbitrary EHA.

11 4 / 16 Normal filter terms Any unquantified A from now on is a fixed but arbitrary EHA. A filter F of A will be called a normal filter if it is compatible with every f M, or equivalently, if θ(f) is a congruence on A.

12 4 / 16 Normal filter terms Any unquantified A from now on is a fixed but arbitrary EHA. A filter F of A will be called a normal filter if it is compatible with every f M, or equivalently, if θ(f) is a congruence on A. Let t be a unary term in the language of A. We say that t is a normal filter term (on A) provided that it is order-preserving, and for every filter F of A, the filter F is a normal filter if and only if F is closed under t A.

13 4 / 16 Normal filter terms Any unquantified A from now on is a fixed but arbitrary EHA. A filter F of A will be called a normal filter if it is compatible with every f M, or equivalently, if θ(f) is a congruence on A. Let t be a unary term in the language of A. We say that t is a normal filter term (on A) provided that it is order-preserving, and for every filter F of A, the filter F is a normal filter if and only if F is closed under t A. Example The identity function is a normal filter term for unexpanded Heyting algebras.

14 5 / 16 Normal filter terms Hence, the algebras from before have normal filter terms. Boolean algebras with operators. If B is a boolean algebra equipped with unary operators f 1,..., f n, then congruences on B are determined by filters closed under the map dx = f 1 x f 2 x... f n x Double-Heyting algebras. Double-Heyting algebras have their congruences determined by filters closed under the map dx = (1 x) 0

15 5 / 16 Normal filter terms Hence, the algebras from before have normal filter terms. Boolean algebras with operators. If B is a boolean algebra equipped with unary operators f 1,..., f n, then congruences on B are determined by filters closed under the map dx = f 1 x f 2 x... f n x Double-Heyting algebras. Double-Heyting algebras have their congruences determined by filters closed under the map dx = (1 x) 0 Let us say that a class of similar algebras has a normal filter term t if t is a normal filter term for each of those algebras.

16 6 / 16 Constructing normal filter terms Let f be an n-ary operation on A. For each a A, define the set f (a) = {f ( x) f ( y) ( i n) x i, y i A and x i y i a}. x y fx fy a

17 6 / 16 Constructing normal filter terms Let f be an n-ary operation on A. For each a A, define the set f (a) = {f ( x) f ( y) ( i n) x i, y i A and x i y i a}. x y fx fy Now define the partial operation [M] by a [M]a = {f (a) f M}.

18 6 / 16 Constructing normal filter terms Let f be an n-ary operation on A. For each a A, define the set f (a) = {f ( x) f ( y) ( i n) x i, y i A and x i y i a}. x y fx fy a Now define the partial operation [M] by [M]a = {f (a) f M}. If it is defined everywhere then we say that [M] exists in A.

19 7 / 16 Constructing normal filter terms A unary map f is an operator 1 if f (x y) = fx fy and f 1 = 1. 1 Actually a dual normal operator

20 7 / 16 Constructing normal filter terms A unary map f is an operator 1 if f (x y) = fx fy and f 1 = 1. Lemma (Hasimoto, 2001) If [M] exists, then [M] is a (dual normal) operator. 1 Actually a dual normal operator

21 7 / 16 Constructing normal filter terms A unary map f is an operator 1 if f (x y) = fx fy and f 1 = 1. Lemma (Hasimoto, 2001) If [M] exists, then [M] is a (dual normal) operator. Lemma (Hasimoto, 2001) Assume that M is finite, and every map in M is an operator. Then [M] exists, and [M]x = {fx f M} 1 Actually a dual normal operator

22 7 / 16 Constructing normal filter terms A unary map f is an operator 1 if f (x y) = fx fy and f 1 = 1. Lemma (Hasimoto, 2001) If [M] exists, then [M] is a (dual normal) operator. Lemma (Hasimoto, 2001) Assume that M is finite, and every map in M is an operator. Then [M] exists, and [M]x = {fx f M} Lemma (T., 2016) If there exists a term t in the language of A such that t A x = [M]x, then t is a normal filter term. 1 Actually a dual normal operator

23 8 / 16 Constructing normal filter terms It is easy to show that if normal filter terms t 1 and t 2 exist for signatures M 1 and M 2 then t 1 t 2 is a normal filter term for M 1 M 2, so we will redirect our focus towards normal filter terms for single functions.

24 8 / 16 Constructing normal filter terms It is easy to show that if normal filter terms t 1 and t 2 exist for signatures M 1 and M 2 then t 1 t 2 is a normal filter term for M 1 M 2, so we will redirect our focus towards normal filter terms for single functions. Let A be a Heyting algebra and let f be a unary operation on A. The map f is an anti-operator if f (x y) = fx fy, and, f 1 = 0.

25 8 / 16 Constructing normal filter terms It is easy to show that if normal filter terms t 1 and t 2 exist for signatures M 1 and M 2 then t 1 t 2 is a normal filter term for M 1 M 2, so we will redirect our focus towards normal filter terms for single functions. Let A be a Heyting algebra and let f be a unary operation on A. The map f is an anti-operator if f (x y) = fx fy, and, f 1 = 0. Lemma (T., 2016) Let A be an EHA and let f be an anti-operator on A. Then [f ] exists, and [f ]x = fx, where x = x 0.

26 9 / 16 Examples Example (Meskhi, 1982) Heyting algebras with involution. Let A be a Heyting algebra equipped with a single unary operation i that is a dual automorphism. The map tx := ix is a normal filter term on A.

27 9 / 16 Examples Example (Meskhi, 1982) Heyting algebras with involution. Let A be a Heyting algebra equipped with a single unary operation i that is a dual automorphism. The map tx := ix is a normal filter term on A. A unary operation on a lattice A is a dual pseudocomplement operation if the following equivalence is satisfied for all x A: x y = 1 y x.

28 9 / 16 Examples Example (Meskhi, 1982) Heyting algebras with involution. Let A be a Heyting algebra equipped with a single unary operation i that is a dual automorphism. The map tx := ix is a normal filter term on A. A unary operation on a lattice A is a dual pseudocomplement operation if the following equivalence is satisfied for all x A: x y = 1 y x. Example (Sankappanavar, 1985) Dually pseudocomplemented Heyting algebras. Let A be a Heyting algebra expanded by a dual pseudocomplement operation. Then is a normal filter term on A.

29 10 / 16 Double-Heyting algebras A double-heyting algebra is an EHA with M = { }, where is a binary operation satisfying x y z y z x.

30 10 / 16 Double-Heyting algebras A double-heyting algebra is an EHA with M = { }, where is a binary operation satisfying x y z y z x. Observe that 1 x defines a dual pseudocomplement operation.

31 10 / 16 Double-Heyting algebras A double-heyting algebra is an EHA with M = { }, where is a binary operation satisfying x y z y z x. Observe that 1 x defines a dual pseudocomplement operation. Theorem (Sankappanavar, 1985) Congruences on a double-heyting algebra are exactly the congruences of the,,,, 0, 1 term-reduct.

32 10 / 16 Double-Heyting algebras A double-heyting algebra is an EHA with M = { }, where is a binary operation satisfying x y z y z x. Observe that 1 x defines a dual pseudocomplement operation. Theorem (Sankappanavar, 1985) Congruences on a double-heyting algebra are exactly the congruences of the,,,, 0, 1 term-reduct. We can also prove directly that [ ] =, but it does not fall into the general cases seen earlier.

33 11 / 16 Double-Heyting algebras Let A be an expanded double-heyting algebra. For a filter F A, let I(F) = F := {y A ( x F) y x}.

34 11 / 16 Double-Heyting algebras Let A be an expanded double-heyting algebra. For a filter F A, let I(F) = F := {y A ( x F) y x}. Theorem (T., 2016) Let A be a double-heyting algebra and let F be a normal filter of A.

35 11 / 16 Double-Heyting algebras Let A be an expanded double-heyting algebra. For a filter F A, let I(F) = F := {y A ( x F) y x}. Theorem (T., 2016) Let A be a double-heyting algebra and let F be a normal filter of A. The map I is an isomorphism from normal filters to the lattice of ideals closed under.

36 11 / 16 Double-Heyting algebras Let A be an expanded double-heyting algebra. For a filter F A, let I(F) = F := {y A ( x F) y x}. Theorem (T., 2016) Let A be a double-heyting algebra and let F be a normal filter of A. The map I is an isomorphism from normal filters to the lattice of ideals closed under. If f is a unary order-preserving map then F is closed under f if and only if I(F) is closed under f, and, I(F) is closed under f if and only if F is closed under f.

37 11 / 16 Double-Heyting algebras Let A be an expanded double-heyting algebra. For a filter F A, let I(F) = F := {y A ( x F) y x}. Theorem (T., 2016) Let A be a double-heyting algebra and let F be a normal filter of A. The map I is an isomorphism from normal filters to the lattice of ideals closed under. If f is a unary order-preserving map then F is closed under f if and only if I(F) is closed under f, and, I(F) is closed under f if and only if F is closed under f. The above theorem holds for dually pseudocomplemented Heyting algebras as well.

38 12 / 16 Double-Heyting algebras F is closed under f if and only if I(F) is closed under f. I(F) is closed under f if and only if F is closed under f.

39 12 / 16 Double-Heyting algebras F is closed under f if and only if I(F) is closed under f. I(F) is closed under f if and only if F is closed under f. Theorem (T., 2016) Let A be an EHA and assume M. Let f be a unary operation on A If f preserves joins and f 0 = 0 then f x is a normal filter term for f. If f reverses joins and f 1 = 0 then f x is a normal filter term for f.

40 12 / 16 Double-Heyting algebras F is closed under f if and only if I(F) is closed under f. I(F) is closed under f if and only if F is closed under f. Theorem (T., 2016) Let A be an EHA and assume M. Let f be a unary operation on A If f preserves joins and f 0 = 0 then f x is a normal filter term for f. If f reverses joins and f 1 = 0 then f x is a normal filter term for f. Open problem The proof of the above very explicitly relies on the operation in the signature. Does the result still apply if we dispose of it?

41 13 / 16 Subdirectly irreducibles Lemma Let A be an EHA, let t be a normal filter term on A, and let dx = x tx. Then (y, 1) Cg A (x, 1) if and only if y d n x for some n ω.

42 13 / 16 Subdirectly irreducibles x

43 13 / 16 Subdirectly irreducibles tx x

44 13 / 16 Subdirectly irreducibles tx x dx

45 13 / 16 Subdirectly irreducibles tx x tdx dx

46 13 / 16 Subdirectly irreducibles tx x tdx dx d 2 x

47 13 / 16 Subdirectly irreducibles Lemma Let A be an EHA, let t be a normal filter term on A, and let dx = x tx. Then (y, 1) Cg A (x, 1) if and only if y d n x for some n ω. Lemma Let A be an EHA, let t be a normal filter term on A, and let dx = x tx. 1. A is subdirectly irreducible if and only if there exists b A\{1} such that for all x A\{1} there exists n ω such that d n x b. 2. A is simple if and only if for all x A\{1} there exists n ω such that d n x = 0.

48 14 / 16 EDPC A variety V has definable principal congruences (DPC) if there exists a first-order formula ϕ(x, y, z, w) in the language of V such that, for all A V, and all a, b, c, d A, we have (a, b) Cg A (c, d) A = ϕ(a, b, c, d). If ϕ is a finite conjunction of equations then V has equationally definable principal congruences (EDPC).

49 14 / 16 EDPC A variety V has definable principal congruences (DPC) if there exists a first-order formula ϕ(x, y, z, w) in the language of V such that, for all A V, and all a, b, c, d A, we have (a, b) Cg A (c, d) A = ϕ(a, b, c, d). If ϕ is a finite conjunction of equations then V has equationally definable principal congruences (EDPC). Theorem (T., 2016) Let V be a variety of EHAs with a common normal filter term t, and let dx = x tx. The following are equivalent: 1. V has EDPC, 2. V has DPC, 3. V = d n+1 x = d n x for some n ω.

50 15 / 16 Discriminator varieties A variety is semisimple if every subdirectly irreducible member of V is simple. If there is a ternary term t in the language of V such that t is a discriminator term on every subdirectly irreducible member of V, i.e., { x if x y t(x, y, z) = z if x = y, then V is a discriminator variety.

51 15 / 16 Discriminator varieties A variety is semisimple if every subdirectly irreducible member of V is simple. If there is a ternary term t in the language of V such that t is a discriminator term on every subdirectly irreducible member of V, i.e., { x if x y t(x, y, z) = z if x = y, then V is a discriminator variety. Theorem (Blok, Köhler and Pigozzi, 1984) Let V be a variety of any signature. The following are equivalent: 1. V is semisimple, congruence permutable, and has EDPC. 2. V is a discriminator variety.

52 16 / 16 Discriminator varieties Theorem (T., 2016) Let V be a variety of dually pseudocomplemented EHAs, assume V has a normal filter term t, and let dx = x tx. The following are equivalent. 1. V is semisimple. 2. V is a discriminator variety. 3. V has DPC and m ω such that V = x d d m x. 4. V has EDPC and m ω such that V = x d d m x. 5. V = d n+1 x = d n x and V = d d n x = d n x for some n This generalises a result by Kowalski and Kracht (2006) for BAOs.

Christopher J. TAYLOR

Christopher J. TAYLOR REPORTS ON MATHEMATICAL LOGIC 51 (2016), 3 14 doi:10.4467/20842589rm.16.001.5278 Christopher J. TAYLOR DISCRIMINATOR VARIETIES OF DOUBLE-HEYTING ALGEBRAS A b s t r a c t. We prove that a variety of double-heyting

More information

Congruence Computations in Principal Arithmetical Varieties

Congruence Computations in Principal Arithmetical Varieties Congruence Computations in Principal Arithmetical Varieties Alden Pixley December 24, 2011 Introduction In the present note we describe how a single term which can be used for computing principal congruence

More information

Quasi-primal Cornish algebras

Quasi-primal Cornish algebras 1 / 26 Quasi-primal Cornish algebras Brian A. Davey and Asha Gair La Trobe University Australia TACL, 24 June 2015 Ischia 2 / 26 Why quasi-primal algebras? Why Cornish algebras? Priestley duality for Cornish

More information

Boolean Semilattices

Boolean Semilattices Boolean Semilattices Clifford Bergman Iowa State University June 2015 Motivating Construction Let G = G, be a groupoid (i.e., 1 binary operation) Form the complex algebra G + = Sb(G),,,,,, G X Y = { x

More information

Congruence Boolean Lifting Property

Congruence Boolean Lifting Property Congruence Boolean Lifting Property George GEORGESCU and Claudia MUREŞAN University of Bucharest Faculty of Mathematics and Computer Science Academiei 14, RO 010014, Bucharest, Romania Emails: georgescu.capreni@yahoo.com;

More information

Varieties of Heyting algebras and superintuitionistic logics

Varieties of Heyting algebras and superintuitionistic logics Varieties of Heyting algebras and superintuitionistic logics Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili email: N.Bezhanishvili@uva.nl

More information

VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS

VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS TOMMASO MORASCHINI Abstract. Positive modal algebras are the,,,, 0, 1 -subreducts of modal algebras. We show that the variety of positive

More information

Boolean Algebra and Propositional Logic

Boolean Algebra and Propositional Logic Boolean Algebra and Propositional Logic Takahiro Kato September 10, 2015 ABSTRACT. This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a

More information

Relations on Hypergraphs

Relations on Hypergraphs Relations on Hypergraphs John Stell School of Computing, University of Leeds RAMiCS 13 Cambridge, 17th September 2012 Relations on a Set Boolean algebra Converse R = R Complement R = R Composition & residuation

More information

Congruence lattices and Compact Intersection Property

Congruence lattices and Compact Intersection Property Congruence lattices and Compact Intersection Property Slovak Academy of Sciences, Košice June 8, 2013 Congruence lattices Problem. For a given class K of algebras describe Con K =all lattices isomorphic

More information

SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM

SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM SPECTRAL-LIKE DUALITY FOR DISTRIBUTIVE HILBERT ALGEBRAS WITH INFIMUM SERGIO A. CELANI AND MARÍA ESTEBAN Abstract. Distributive Hilbert Algebras with infimum, or DH -algebras, are algebras with implication

More information

Boolean Algebra and Propositional Logic

Boolean Algebra and Propositional Logic Boolean Algebra and Propositional Logic Takahiro Kato June 23, 2015 This article provides yet another characterization of Boolean algebras and, using this characterization, establishes a more direct connection

More information

Universal Algebra for Logics

Universal Algebra for Logics Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic

More information

Embedding theorems for normal divisible residuated lattices

Embedding theorems for normal divisible residuated lattices Embedding theorems for normal divisible residuated lattices Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics and Computer

More information

On the filter theory of residuated lattices

On the filter theory of residuated lattices On the filter theory of residuated lattices Jiří Rachůnek and Dana Šalounová Palacký University in Olomouc VŠB Technical University of Ostrava Czech Republic Orange, August 5, 2013 J. Rachůnek, D. Šalounová

More information

Unification of terms and language expansions

Unification of terms and language expansions Unification of terms and language expansions in Heyting algebras and commutative residuated lattices Wojciech Dzik Instytut Matematyki Uniwersytet Sl aski, Katowice wojciech.dzik@us.edu.pl joint work with

More information

arxiv: v1 [math.lo] 10 Sep 2013

arxiv: v1 [math.lo] 10 Sep 2013 STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION arxiv:1309.2422v1 [math.lo] 10 Sep 2013 MAI GEHRKE Abstract. Our main result is that any topological algebra based on a Boolean space is the extended

More information

Priestley Duality for Bilattices

Priestley Duality for Bilattices A. Jung U. Rivieccio Priestley Duality for Bilattices In memoriam Leo Esakia Abstract. We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar

More information

The connection of skew Boolean algebras and discriminator varieties to Church algebras

The connection of skew Boolean algebras and discriminator varieties to Church algebras The connection of skew Boolean algebras and discriminator varieties to Church algebras Karin Cvetko-Vah and Antonino Salibra Abstract. We establish a connection between skew Boolean algebras and Church

More information

ARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), M. Sambasiva Rao

ARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), M. Sambasiva Rao ARCHIVUM MATHEMATICUM (BRNO) Tomus 48 (2012), 97 105 δ-ideals IN PSEUDO-COMPLEMENTED DISTRIBUTIVE LATTICES M. Sambasiva Rao Abstract. The concept of δ-ideals is introduced in a pseudo-complemented distributive

More information

The prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce

The prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce The prime spectrum of MV-algebras based on a joint work with A. Di Nola and P. Belluce Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada

More information

Relational semantics for a fragment of linear logic

Relational semantics for a fragment of linear logic Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.

More information

A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY

A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY A CHARACTERIZATION OF LOCALLY FINITE VARIETIES THAT SATISFY A NONTRIVIAL CONGRUENCE IDENTITY KEITH A. KEARNES Abstract. We show that a locally finite variety satisfies a nontrivial congruence identity

More information

Finite pseudocomplemented lattices: The spectra and the Glivenko congruence

Finite pseudocomplemented lattices: The spectra and the Glivenko congruence Finite pseudocomplemented lattices: The spectra and the Glivenko congruence T. Katriňák and J. Guričan Abstract. Recently, Grätzer, Gunderson and Quackenbush have characterized the spectra of finite pseudocomplemented

More information

JOIN-COMPLETIONS OF ORDERED ALGEBRAS

JOIN-COMPLETIONS OF ORDERED ALGEBRAS JOIN-COMPLETIONS OF ORDERED ALGEBRAS JOSÉ GIL-FÉREZ, LUCA SPADA, CONSTANTINE TSINAKIS, AND HONGJUN ZHOU Abstract. We present a systematic study of join-extensions and joincompletions of ordered algebras,

More information

On the Structure of Rough Approximations

On the Structure of Rough Approximations On the Structure of Rough Approximations (Extended Abstract) Jouni Järvinen Turku Centre for Computer Science (TUCS) Lemminkäisenkatu 14 A, FIN-20520 Turku, Finland jjarvine@cs.utu.fi Abstract. We study

More information

On the algebra of relevance logics

On the algebra of relevance logics On the algebra of relevance logics by Johann Joubert Wannenburg Submitted in partial fulfilment of the requirements for the degree Master of Science in the Faculty of Natural & Agricultural Sciences University

More information

Abelian Algebras and the Hamiltonian Property. Abstract. In this paper we show that a nite algebra A is Hamiltonian if the

Abelian Algebras and the Hamiltonian Property. Abstract. In this paper we show that a nite algebra A is Hamiltonian if the Abelian Algebras and the Hamiltonian Property Emil W. Kiss Matthew A. Valeriote y Abstract In this paper we show that a nite algebra A is Hamiltonian if the class HS(A A ) consists of Abelian algebras.

More information

Lattice Theory Lecture 5. Completions

Lattice Theory Lecture 5. Completions Lattice Theory Lecture 5 Completions John Harding New Mexico State University www.math.nmsu.edu/ JohnHarding.html jharding@nmsu.edu Toulouse, July 2017 Completions Definition A completion of a poset P

More information

A simple propositional calculus for compact Hausdor spaces

A simple propositional calculus for compact Hausdor spaces A simple propositional calculus for compact Hausdor spaces G. Bezhanishvili N. Bezhanishvili T. Santoli Y. Venema Abstract We introduce a simple propositional calculus for compact Hausdor spaces. Our approach

More information

A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS

A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS Bulletin of the Section of Logic Volume 11:3/4 (1982), pp. 134 138 reedition 2009 [original edition, pp. 134 139] Bogus law Wolniewicz A CLOSURE SYSTEM FOR ELEMENTARY SITUATIONS 1. Preliminaries In [4]

More information

Annals of Pure and Applied Logic. The universal modality, the center of a Heyting algebra, and the Blok Esakia theorem

Annals of Pure and Applied Logic. The universal modality, the center of a Heyting algebra, and the Blok Esakia theorem Annals of Pure and Applied Logic 161 (2009) 253 267 Contents lists available at ScienceDirect Annals of Pure and Applied Logic journal homepage: www.elsevier.com/locate/apal The universal modality, the

More information

Given a lattice L we will note the set of atoms of L by At (L), and with CoAt (L) the set of co-atoms of L.

Given a lattice L we will note the set of atoms of L by At (L), and with CoAt (L) the set of co-atoms of L. ACTAS DEL VIII CONGRESO DR. ANTONIO A. R. MONTEIRO (2005), Páginas 25 32 SOME REMARKS ON OCKHAM CONGRUENCES LEONARDO CABRER AND SERGIO CELANI ABSTRACT. In this work we shall describe the lattice of congruences

More information

IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS

IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS Scientiae Mathematicae Japonicae Online, Vol. 8, (2003), 597 606 597 IMPLICATIVE BCS-ALGEBRA SUBREDUCTS OF SKEW BOOLEAN ALGEBRAS R. J. BIGNALL AND M. SPINKS Received April 1, 2003 Abstract. The variety

More information

Introducing Boolean Semilattices

Introducing Boolean Semilattices Introducing Boolean Semilattices Clifford Bergman The study of Boolean algebras with operators (BAOs) has been a consistent theme in algebraic logic throughout its history. It provides a unifying framework

More information

A strongly rigid binary relation

A strongly rigid binary relation A strongly rigid binary relation Anne Fearnley 8 November 1994 Abstract A binary relation ρ on a set U is strongly rigid if every universal algebra on U such that ρ is a subuniverse of its square is trivial.

More information

Lattice-theoretic properties of algebras of logic

Lattice-theoretic properties of algebras of logic Lattice-theoretic properties of algebras of logic Antonio Ledda Università di Cagliari, via Is Mirrionis 1, 09123, Cagliari, Italy Francesco Paoli Università di Cagliari, via Is Mirrionis 1, 09123, Cagliari,

More information

On Jankov-de Jongh formulas

On Jankov-de Jongh formulas On Jankov-de Jongh formulas Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili The Heyting day dedicated to Dick de Jongh and

More information

From λ-calculus to universal algebra and back

From λ-calculus to universal algebra and back From λ-calculus to universal algebra and back Giulio Manzonetto 1 and Antonino Salibra 1,2 1 Laboratoire PPS, CNRS-Université Paris 7, 2 Dip. Informatica, Università Ca Foscari di Venezia, Abstract. We

More information

Stipulations, multivalued logic, and De Morgan algebras

Stipulations, multivalued logic, and De Morgan algebras Stipulations, multivalued logic, and De Morgan algebras J. Berman and W. J. Blok Department of Mathematics, Statistics, and Computer Science University of Illinois at Chicago Chicago, IL 60607 U.S.A. Dedicated

More information

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R +

Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + REPORTS ON MATHEMATICAL LOGIC 40 (2006), 3 13 Kazimierz SWIRYDOWICZ UPPER PART OF THE LATTICE OF EXTENSIONS OF THE POSITIVE RELEVANT LOGIC R + A b s t r a c t. In this paper it is proved that the interval

More information

CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS

CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS CLASSIFYING THE COMPLEXITY OF CONSTRAINTS USING FINITE ALGEBRAS ANDREI BULATOV, PETER JEAVONS, AND ANDREI KROKHIN Abstract. Many natural combinatorial problems can be expressed as constraint satisfaction

More information

Constructing the Lindenbaum algebra for a logic step-by-step using duality (extended version)

Constructing the Lindenbaum algebra for a logic step-by-step using duality (extended version) Constructing the Lindenbaum algebra for a logic step-by-step using duality (extended version) Dion Coumans and Sam van Gool Abstract We discuss the incremental construction of the Lindenbaum algebra for

More information

Canonical extensions and the intermediate structure

Canonical extensions and the intermediate structure Canonical extensions and the intermediate structure Andrew Craig Mathematical Institute, Oxford University Workshop on Lattices, Relations and Kleene Algebras UCL 21 September 2010 Let L be a lattice and

More information

Subdirectly irreducible algebras in varieties of universal algebras

Subdirectly irreducible algebras in varieties of universal algebras Subdirectly irreducible algebras in varieties of universal algebras Dorien Zwaneveld August 5, 204 Bachelorthesis Supervisors: dr. N. Bezhanishvili, J. Ilin Msc Korteweg-de Vries Institute for Mathematics

More information

The Blok-Ferreirim theorem for normal GBL-algebras and its application

The Blok-Ferreirim theorem for normal GBL-algebras and its application The Blok-Ferreirim theorem for normal GBL-algebras and its application Chapman University Department of Mathematics and Computer Science Orange, California University of Siena Department of Mathematics

More information

Introduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory

Introduction. Itaï Ben-Yaacov C. Ward Henson. September American Institute of Mathematics Workshop. Continuous logic Continuous model theory Itaï Ben-Yaacov C. Ward Henson American Institute of Mathematics Workshop September 2006 Outline Continuous logic 1 Continuous logic 2 The metric on S n (T ) Origins Continuous logic Many classes of (complete)

More information

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω

The non-logical symbols determine a specific F OL language and consists of the following sets. Σ = {Σ n } n<ω 1 Preliminaries In this chapter we first give a summary of the basic notations, terminology and results which will be used in this thesis. The treatment here is reduced to a list of definitions. For the

More information

Notes about Filters. Samuel Mimram. December 6, 2012

Notes about Filters. Samuel Mimram. December 6, 2012 Notes about Filters Samuel Mimram December 6, 2012 1 Filters and ultrafilters Definition 1. A filter F on a poset (L, ) is a subset of L which is upwardclosed and downward-directed (= is a filter-base):

More information

Clones (3&4) Martin Goldstern. TACL Olomouc, June Discrete Mathematics and Geometry, TU Wien

Clones (3&4) Martin Goldstern. TACL Olomouc, June Discrete Mathematics and Geometry, TU Wien Martin Goldstern Discrete Mathematics and Geometry, TU Wien TACL Olomouc, June 2017 Galois connections Let A, B be sets, R A B. For any S A and any T B let S u := {b B a S : arb} T l := {a A b T : arb}.

More information

Duality and Automata Theory

Duality and Automata Theory Duality and Automata Theory Mai Gehrke Université Paris VII and CNRS Joint work with Serge Grigorieff and Jean-Éric Pin Elements of automata theory A finite automaton a 1 2 b b a 3 a, b The states are

More information

Tutorial on the Constraint Satisfaction Problem

Tutorial on the Constraint Satisfaction Problem Tutorial on the Constraint Satisfaction Problem Miklós Maróti Vanderbilt University and University of Szeged Nový Smokovec, 2012. September 2 7. Miklós Maróti (Vanderbilt and Szeged) The Constraint Satisfaction

More information

A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS

A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS A STUDY OF TRUTH PREDICATES IN MATRIX SEMANTICS TOMMASO MORASCHINI Abstract. Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics.

More information

STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION

STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION Mai Gehrke To cite this version: Mai Gehrke. STONE DUALITY, TOPOLOGICAL ALGEBRA, AND RECOGNITION. Journal of Pure and Applied Algebra, Elsevier, 2016.

More information

Duality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) +

Duality in Logic. Duality in Logic. Lecture 2. Mai Gehrke. Université Paris 7 and CNRS. {ε} A ((ab) (ba) ) (ab) + (ba) + Lecture 2 Mai Gehrke Université Paris 7 and CNRS A {ε} A ((ab) (ba) ) (ab) + (ba) + Further examples - revisited 1. Completeness of modal logic with respect to Kripke semantics was obtained via duality

More information

University of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor

University of Oxford, Michaelis November 16, Categorical Semantics and Topos Theory Homotopy type theor Categorical Semantics and Topos Theory Homotopy type theory Seminar University of Oxford, Michaelis 2011 November 16, 2011 References Johnstone, P.T.: Sketches of an Elephant. A Topos-Theory Compendium.

More information

Math 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001

Math 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001 Math 588, Fall 2001 Problem Set 1 Due Sept. 18, 2001 1. [Burris-Sanka. 1.1.9] Let A, be a be a finite poset. Show that there is a total (i.e., linear) order on A such that, i.e., a b implies a b. Hint:

More information

VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS

VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS T. MORASCHINI, J.G. RAFTERY, AND J.J. WANNENBURG Abstract. The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible

More information

Π 0 1-presentations of algebras

Π 0 1-presentations of algebras Π 0 1-presentations of algebras Bakhadyr Khoussainov Department of Computer Science, the University of Auckland, New Zealand bmk@cs.auckland.ac.nz Theodore Slaman Department of Mathematics, The University

More information

DUALITIES, NATURAL AND OTHERWISE GAIA With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer

DUALITIES, NATURAL AND OTHERWISE GAIA With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer DUALITIES, NATURAL AND OTHERWISE Hilary Priestley Mathematical Institute, University of Oxford GAIA 2013 With acknowledgements, in particular, to Brian Davey and Leonardo Cabrer From Brian Davey s La Trobe

More information

Related structures with involution

Related structures with involution Related structures with involution R. Pöschel 1 and S. Radeleczki 2 1 Institut für Algebra, TU Dresden, 01062 Dresden, Germany e-mail: Reinhard.Poeschel@tu-dresden.de 2 Institute of Mathematics, University

More information

A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY

A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY A GUIDE FOR MORTALS TO TAME CONGRUENCE THEORY Tame congruence theory is not an easy subject and it takes a considerable amount of effort to understand it. When I started this project, I believed that this

More information

ON SEMI-BOOLEAN-LIKE ALGEBRAS

ON SEMI-BOOLEAN-LIKE ALGEBRAS ON SEMI-BOOLEAN-LIKE ALGEBRAS ANTONIO LEDDA, FRANCESCO PAOLI, ANTONINO SALIBRA A. In a previous paper, we introduced the notion of Boolean-like algebra as a generalisation of Boolean algebras to an arbitrary

More information

SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING

SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING SUPERPRODUCTS, HYPERIDENTITIES, AND ALGEBRAIC STRUCTURES OF LOGIC PROGRAMMING YU.M.MOVSISYAN 1, A.B.ROMANOWSKA 2, AND J.D.H.SMITH 3 Abstract. Recent developments in logic programming are based on bilattices

More information

SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS

SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex

More information

Tense Operators on m Symmetric Algebras

Tense Operators on m Symmetric Algebras International Mathematical Forum, Vol. 6, 2011, no. 41, 2007-2014 Tense Operators on m Symmetric Algebras Aldo V. Figallo Universidad Nacional de San Juan. Instituto de Ciencias Básicas Avda. I. de la

More information

An Introduction to the Theory of Lattice

An Introduction to the Theory of Lattice An Introduction to the Theory of Lattice Jinfang Wang Λy Graduate School of Science and Technology, Chiba University 1-33 Yayoi-cho, Inage-ku, Chiba 263-8522, Japan May 11, 2006 Λ Fax: 81-43-290-3663.

More information

Houston Journal of Mathematics. c 2007 University of Houston Volume 33, No. 1, 2007

Houston Journal of Mathematics. c 2007 University of Houston Volume 33, No. 1, 2007 Houston Journal of Mathematics c 2007 University of Houston Volume 33, No. 1, 2007 WHEN IS A FULL DUALITY STRONG? BRIAN A. DAVEY, MIROSLAV HAVIAR, AND TODD NIVEN Communicated by Klaus Kaiser Abstract.

More information

Logics without the contraction rule residuated lattices. Citation Australasian Journal of Logic, 8(1):

Logics without the contraction rule residuated lattices. Citation Australasian Journal of Logic, 8(1): JAIST Reposi https://dspace.j Title Logics without the contraction rule residuated lattices Author(s)Ono, Hiroakira Citation Australasian Journal of Logic, 8(1): Issue Date 2010-09-22 Type Journal Article

More information

On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras

On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras On the size of Heyting Semi-Lattices and Equationally Linear Heyting Algebras Peter Freyd pjf@upenn.edu July 17, 2017 The theory of Heyting Semi-Lattices, hsls for short, is obtained by adding to the theory

More information

Jónsson posets and unary Jónsson algebras

Jónsson posets and unary Jónsson algebras Jónsson posets and unary Jónsson algebras Keith A. Kearnes and Greg Oman Abstract. We show that if P is an infinite poset whose proper order ideals have cardinality strictly less than P, and κ is a cardinal

More information

The lattice of varieties generated by residuated lattices of size up to 5

The lattice of varieties generated by residuated lattices of size up to 5 The lattice of varieties generated by residuated lattices of size up to 5 Peter Jipsen Chapman University Dedicated to Hiroakira Ono on the occasion of his 7th birthday Introduction Residuated lattices

More information

Propositional Logics and their Algebraic Equivalents

Propositional Logics and their Algebraic Equivalents Propositional Logics and their Algebraic Equivalents Kyle Brooks April 18, 2012 Contents 1 Introduction 1 2 Formal Logic Systems 1 2.1 Consequence Relations......................... 2 3 Propositional Logic

More information

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST

Discrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and

More information

RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS

RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS RESIDUALLY FINITE VARIETIES OF NONASSOCIATIVE ALGEBRAS KEITH A. KEARNES AND YOUNG JO KWAK Abstract. We prove that if V is a residually finite variety of nonassociative algebras over a finite field, and

More information

Formal groups. Peter Bruin 2 March 2006

Formal groups. Peter Bruin 2 March 2006 Formal groups Peter Bruin 2 March 2006 0. Introduction The topic of formal groups becomes important when we want to deal with reduction of elliptic curves. Let R be a discrete valuation ring with field

More information

SMALL CONGRUENCE LATTICES

SMALL CONGRUENCE LATTICES SMALL CONGRUENCE LATTICES William DeMeo williamdemeo@gmail.com University of South Carolina joint work with Ralph Freese, Peter Jipsen, Bill Lampe, J.B. Nation BLAST Conference Chapman University August

More information

Model theory for metric structures

Model theory for metric structures Model theory for metric structures Itaï Ben Yaacov Alexander Berenstein C. Ward Henson Alexander Usvyatsov Contents 1 Introduction 1 2 Metric structures and signatures 4 3 Formulas and their interpretations

More information

Constructive version of Boolean algebra

Constructive version of Boolean algebra Constructive version of Boolean algebra Francesco Ciraulo, Maria Emilia Maietti, Paola Toto Abstract The notion of overlap algebra introduced by G. Sambin provides a constructive version of complete Boolean

More information

Algebras. Larry Moss Indiana University, Bloomington. TACL 13 Summer School, Vanderbilt University

Algebras. Larry Moss Indiana University, Bloomington. TACL 13 Summer School, Vanderbilt University 1/39 Algebras Larry Moss Indiana University, Bloomington TACL 13 Summer School, Vanderbilt University 2/39 Binary trees Let T be the set which starts out as,,,, 2/39 Let T be the set which starts out as,,,,

More information

Programming Languages in String Diagrams. [ four ] Local stores. Paul-André Melliès. Oregon Summer School in Programming Languages June 2011

Programming Languages in String Diagrams. [ four ] Local stores. Paul-André Melliès. Oregon Summer School in Programming Languages June 2011 Programming Languages in String iagrams [ four ] Local stores Paul-André Melliès Oregon Summer School in Programming Languages June 2011 Finitary monads A monadic account of algebraic theories Algebraic

More information

Morita-equivalences for MV-algebras

Morita-equivalences for MV-algebras Morita-equivalences for MV-algebras Olivia Caramello* University of Insubria Geometry and non-classical logics 5-8 September 2017 *Joint work with Anna Carla Russo O. Caramello Morita-equivalences for

More information

arxiv: v1 [cs.pl] 19 May 2016

arxiv: v1 [cs.pl] 19 May 2016 arxiv:1605.05858v1 [cs.pl] 19 May 2016 Domain Theory: An Introduction Robert Cartwright Rice University Rebecca Parsons ThoughtWorks, Inc. Moez AbdelGawad SRTA-City Hunan University This monograph is an

More information

LATTICES OF ATOMIC THEORIES IN LANGUAGES WITHOUT EQUALITY

LATTICES OF ATOMIC THEORIES IN LANGUAGES WITHOUT EQUALITY LATTICES OF ATOMIC THEORIES IN LANGUAGES WITHOUT EQUALITY TRISTAN HOLMES, DAYNA KITSUWA, J. B. NATION AND SHERI TAMAGAWA Abstract. The structure of lattices of atomic theories in languages without equality

More information

The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable

The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable The model companion of the class of pseudo-complemented semilattices is finitely axiomatizable (joint work with Regula Rupp and Jürg Schmid) Joel Adler joel.adler@phbern.ch Institut S1 Pädagogische Hochschule

More information

arxiv: v2 [math.lo] 25 Jul 2017

arxiv: v2 [math.lo] 25 Jul 2017 Luca Carai and Silvio Ghilardi arxiv:1702.08352v2 [math.lo] 25 Jul 2017 Università degli Studi di Milano, Milano, Italy luca.carai@studenti.unimi.it silvio.ghilardi@unimi.it July 26, 2017 Abstract The

More information

COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS. Peter Jipsen

COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS. Peter Jipsen COMPUTER AIDED INVESTIGATIONS OF RELATION ALGEBRAS By Peter Jipsen Dissertation Submitted to the Faculty of the Graduate School of Vanderbilt University in partial fulfillment of the requirements for the

More information

LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION

LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION LOGICS OF VARIETIES, LOGICS OF SEMILATTICES, AND CONJUNCTION JOSEP MARIA FONT AND TOMMASO MORASCHINI Abstract. This paper starts with a general analysis of the problem of how to associate a logic with

More information

MTL-algebras via rotations of basic hoops

MTL-algebras via rotations of basic hoops MTL-algebras via rotations of basic hoops Sara Ugolini University of Denver, Department of Mathematics (Ongoing joint work with P. Aglianò) 4th SYSMICS Workshop - September 16th 2018 A commutative, integral

More information

MV-algebras and fuzzy topologies: Stone duality extended

MV-algebras and fuzzy topologies: Stone duality extended MV-algebras and fuzzy topologies: Stone duality extended Dipartimento di Matematica Università di Salerno, Italy Algebra and Coalgebra meet Proof Theory Universität Bern April 27 29, 2011 Outline 1 MV-algebras

More information

Algebraic Canonicity in Non-Classical Logics

Algebraic Canonicity in Non-Classical Logics Algebraic Canonicity in Non-Classical Logics MSc Thesis (Afstudeerscriptie) written by Zhiguang Zhao (born November 15th, 1989 in Tai an, China) under the supervision of Dr Alessandra Palmigiano, and submitted

More information

Congruence Coherent Symmetric Extended de Morgan Algebras

Congruence Coherent Symmetric Extended de Morgan Algebras T.S. Blyth Jie Fang Congruence Coherent Symmetric Extended de Morgan Algebras Abstract. An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence

More information

γ γ γ γ(α) ). Then γ (a) γ (a ) ( γ 1

γ γ γ γ(α) ). Then γ (a) γ (a ) ( γ 1 The Correspondence Theorem, which we next prove, shows that the congruence lattice of every homomorphic image of a Σ-algebra is isomorphically embeddable as a special kind of sublattice of the congruence

More information

arxiv: v5 [cs.cc] 17 May 2015

arxiv: v5 [cs.cc] 17 May 2015 SCHAEFER S THEOREM FOR GRAPHS MANUEL BODIRSKY AND MICHAEL PINSKER arxiv:1011.2894v5 [cs.cc] 17 May 2015 Abstract. Schaefer s theorem is a complexity classification result for so-called Boolean constraint

More information

arxiv: v3 [math.rt] 19 Feb 2011

arxiv: v3 [math.rt] 19 Feb 2011 REPRESENTATION OF NELSON ALGEBRAS BY ROUGH SETS DETERMINED BY QUASIORDERS JOUNI JÄRVINEN AND SÁNDOR RADELECZKI arxiv:1007.1199v3 [math.rt] 19 Feb 2011 Abstract. In this paper, we show that every quasiorder

More information

The Relation Reflection Scheme

The Relation Reflection Scheme The Relation Reflection Scheme Peter Aczel petera@cs.man.ac.uk Schools of Mathematics and Computer Science The University of Manchester September 14, 2007 1 Introduction In this paper we introduce a new

More information

Semilattice Modes II: the amalgamation property

Semilattice Modes II: the amalgamation property Semilattice Modes II: the amalgamation property Keith A. Kearnes Abstract Let V be a variety of semilattice modes with associated semiring R. We prove that if R is a bounded distributive lattice, then

More information

A duality-theoretic approach to MTL-algebras

A duality-theoretic approach to MTL-algebras A duality-theoretic approach to MTL-algebras Sara Ugolini (Joint work with W. Fussner) BLAST 2018 - Denver, August 6th 2018 A commutative, integral residuated lattice, or CIRL, is a structure A = (A,,,,,

More information

Algebras. Riley Chien. April 27, 2015

Algebras. Riley Chien. April 27, 2015 Algebras Riley Chien April 27, 2015 Copyright c Riley Chien. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or

More information

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation

Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Extending the Monoidal T-norm Based Logic with an Independent Involutive Negation Tommaso Flaminio Dipartimento di Matematica Università di Siena Pian dei Mantellini 44 53100 Siena (Italy) flaminio@unisi.it

More information