Numbered distributive semilattices

In this article, we consider several definitions of a Lachlan semilattice; i.e., a semilattice isomorphic to a principal ideal of the semilattice of computably enumerable m-degrees. We also answer a series of questions on constructive posets and prove that each distributive semilattice with top and bottom is a Lachlan semilattice if it admits a Σ ₃ ⁰ -representation as an algebra but need not be a Lachlan semilattice if it admits a Σ ₃ ⁰ -representation as a poset. The examples are constructed of distributive lattices that are constructivizable as posets but not constructivizable as join (meet) semilattices. We also prove that every locally lattice poset (in particular, every lattice and every distributive semilattice) possessing a Δ ₂ ⁰ -representation is positive.     

Sémantique algébrique ďun système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′_T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′_T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′_T logic and the intuitionistic and classical logics.     

One Hundred Twenty-Seven Subsemilattices and Planarity

Let L be a finite n-element semilattice. We prove that if L has at least 127 ? 2^n??8 subsemilattices, then L is planar. For n >?8, this result is sharp since there is a non-planar semilattice with exactly 127 ? 2^n??8 ??1 subsemilattices.

     

Inj0在Top上的Monadicity

本文主要证明了全体内射Ｔ₀－空间及强代数映射构成的范畴Ｉｎｊ₀恰是Ｅｉｌｅｎｂｅｒｇ－Ｍｏｏｒｅ范畴Ｔｏｐ^Ｔ,这里Ｔ是Ｔｏｐ与Ｓｌａｔ之间的一对偶伴随导出的ｍｏｎａｄ,由此推出Ｉｎｊ₀在Ｔｏｐ上是ｍｏｎａｄｉｃ的．     

A note on dual‐intuitionistic logic

Dual‐intuitionistic logics are logics proposed by Czermak (1977), Goodman (1981) and Urbas (1996). It is shown in this paper that there is a correspondence between Goodman's dual‐intuitionistic logic and Nelson's constructive logic N^?.     

The Pursuit of an Implication for the Logics L3A and L3B

The authors of Beziau and Franceschetto (New directions in paraconsistent logic, vol 152, Springer, New Delhi, 2015) work with logics that have the property of not satisfying any of the formulations of the principle of non contradiction, Béziau and Franceschetto also analyze, among the three-valued logics, which of these logics satisfy this property. They prove that there exist only four of such logics, but only two of them are worthwhile to study. The language of these logics does not consider implication as a connective. However, the enrichment of a language with an implication connective leads us to more interesting systems, therefore we look for one implication for these logics and we study further properties that the logics obtain when this connective is added to these systems.     

Continuity, proof systems and the theory of transfinite computations

 We use the theory of domains with totality to construct some logics generalizing ω-logic and β-logic and we prove a completenes theorem for these logics. The key application is E-logic, the logic related to the functional ³ E. We prove a compactness theorem for sets of sentences semicomputable in ³ E. Received: 21 January 1998 / Published online: 2 September 2002     

On linearly ordered <Emphasis Type="Italic">H</Emphasis>-closed topological semilattices

We give a criterion for a linearly ordered topological semilattice to be H-closed. We also prove that any linearly ordered H-closed topological semilattice is absolutely H-closed and we show that every linearly ordered semilattice is a dense subsemilattice of an H-closed topological semilattice.     

Labeled sequent calculi for modal logics and implicit contractions

The paper settles an open question concerning Negri-style labeled sequent calculi for modal logics and also, indirectly, other proof systems which make (more or less) explicit use of semantic parameters in the syntax and are thus subsumed by labeled calculi, like Brünnler’s deep sequent calculi, Poggiolesi’s tree-hypersequent calculi and Fitting’s prefixed tableau systems. Specifically, the main result we prove (through a semantic argument) is that labeled calculi for the modal logics K and D remain complete w.r.t. valid sequents whose relational part encodes a tree-like structure, when the unique rule which contains an harmful implicit contraction—by which the condition that the premises be less complex than the conclusion is violated—is modified into a contraction-free one respecting the latter condition, thus making the proof-search space finite.     

Algebraization of logics defined by literal‐paraconsistent or literal‐paracomplete matrices

We study the algebraizability of the logics constructed using literal‐paraconsistent and literal‐paracomplete matrices described by Lewin and Mikenberg in [11], proving that they are all algebraizable in the sense of Blok and Pigozzi in [3] but not finitely algebraizable. A characterization of the finitely algebraizable logics defined by LPP‐matrices is given. We also make an algebraic study of the equivalent algebraic semantics of the logics associated to the matrices ??³_2,2, ??³_2,1, ??³_1,1, ??³_1,3, and ??⁴ appearing in [11] proving that they are not varieties and finding the free algebra over one generator. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the Least Property of the Semilattice Congruences on PO-Semigroups

n on po-semigroups. We study the least property of (ordered) semilattice congruences, and prove: 1. N is the least ordered semilattice congruence on pr-semigroups (cf.[1]). 2. n is the least semilattice congruence on po-semigroups. 3. N is not the least semilattice congruence on po-semigroups in general. Thus, we give a complete solution to the problem posed by N. Kehayopulu in [1].     

Abstract wave equations with acoustic boundary conditions

We define an abstract setting to treat wave equations equipped with time‐dependent acoustic boundary conditions on bounded domains of R ⁿ . We prove a well‐posedness result and develop a spectral theory which also allows to prove a conjecture proposed in [13]. Concrete problems are also discussed. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Dense inverse subsemigroups of a topological inverse semigroup

In this paper we study dense inverse subsemigroups of topological inverse semigroups. We construct a topological inverse semigroup from a semilattice. Finally, we give two examples of the closure of B _{( −∞, ∞ )}¹, a topological inverse semigroup obtained by starting with the real numbers as a semilattice with the operation a ∨ b=sup{a,b}. The author would like to thank to the referee for useful suggestions.     

Categorical abstract algebraic logic: The criterion for deductive equivalence

Equivalent deductive systems were introduced in [4] with the goal of treating 1‐deductive systems and algebraic 2‐deductive systems in a uniform way. Results of [3], appropriately translated and strengthened, show that two deductive systems over the same language type are equivalent if and only if their lattices of theories are isomorphic via an isomorphism that commutes with substitutions. Deductive equivalence of π‐institutions [14, 15] generalizes the notion of equivalence of deductive systems. In [15, Theorem 10.26] this criterion for the equivalence of deductive systems was generalized to a criterion for the deductive equivalence of term π‐institutions, forming a subclass of all π‐institutions that contains those π‐institutions directly corresponding to deductive systems. This criterion is generalized here to cover the case of arbitrary π‐institutions.     

Estimateur a posteriori en norme L∞ pour les équations elliptiquesL∞-a posteriori error estimator for elliptic equations

In this Note, we show that modification of Bank–Wieser estimator introduce an L^∞-a posteriori error estimator for conforming and nonconforming methods. We prove, without saturation assumption nor comparison with residual estimators, the equivalence with the L^∞ error. To cite this article: A. Agouzal, C. R. Acad. Sci. Paris, Ser. I 334 (2002) 411–415.     

Upper bound on the coarsening rate for an epitaxial growth model

We study a specific example of energy‐driven coarsening in two space dimensions. The energy is ∫|??u|² + (1 ‐ | ?u|²)²; the evolution is the fourth‐order PDE representing steepest descent. This equation has been proposed as a model of epitaxial growth for systems with slope selection. Numerical simulations and heuristic arguments indicate that the standard deviation of u grows like t^1/3, and the energy per unit area decays like t^‐1/3. We prove a weak, one‐sided version of the latter statement: The time‐averaged energy per unit area decays no faster than t^‐1/3. Our argument follows a strategy introduced by Kohn and Otto in the context of phase separation, combining (i) a dissipation relation, (ii) an isoperimetric inequality, and (iii) an ODE lemma. The interpolation inequality is new and rather subtle; our proof is by contradiction, relying on recent compactness results for the Aviles‐Giga energy. © 2003 Wiley Periodicals, Inc.     

Associative,Idempotent, Symmetric,and Order-preserving Operations on Chains

We characterize the associative, idempotent, symmetric, and order-preserving binary operations on (finite) chains in terms of properties of (the Hasse diagram of) their associated semilattice order. In particular, we prove that the number of associative, idempotent, symmetric, and order-preserving operations on an n-element chain is the n^th Catalan number.

     

An Equivalence Relation between Multiresolution Analysis ofL(R)

This paper is concerned with the development of an equivalence relation between two multiresolution analysis ofL²(R). The relation called unitary equivalence is created by the action of a unitary operator in such a way that the multiresolution structure and the decomposition and reconstruction algorithms remain invariant. A characterization in terms of the scaling functions of the multiresolution analysis is given. Distinct equivalence classes of multiresolution analysis are derived. Finally, we prove that B-splines give rise to nonequivalent examples.     

The universal Lachlan semilattice without the greatest element

We deal with some upper semilattices of m-degrees and of numberings of finite families. It is proved that the semilattice of all c.e. m-degrees, from which the greatest element is removed, is isomorphic to the semilattice of simple m-degrees, the semilattice of hypersimple m-degrees, and the semilattice of Σ ₂ ⁰ -computable numberings of a finite family of Σ ₂ ⁰ -sets, which contains more than one element and does not contain elements that are comparable w.r.t. inclusion. Supported by the Grant Council (under RF President) for Young Russian Scientists via project MK-1820.2005.1. __________ Translated from Algebra i Logika, Vol. 46, No. 3, pp. 299–345, May–June, 2007.     

On Semilattice Decomposition of an Abel–Grassmann’s Groupoid

In this paper, we have decomposed an AG-groupoid. Let S be an AG-groupoid with left identity and a relation γ be defined on S as: aγb if and only if there exist positive integers m and n such that bm ∈ ( Sa)S and a n ∈ ( Sb)S for all a and b in S. We have proved that S/γ is a maximal separative semilattice homomorphic image of S. Every AG-groupoid S is uniquely expressible as a semilattice Y of archimedean AG-groupoids Sα (α∈ Y ). The semilattice Y is isomorphic to S/γ and the S α (α∈ Y ) are the equivalence classes of S mod γ.