排序方式: 共有71条查询结果,搜索用时 31 毫秒
61.
In the paper we obtain a new characterization of the BCK-algebras which are subdirect product of BCK-chains. We give an axiomatic algebraizable extension of the BCK-calculus, by means of a recursively enumerable set of axioms, such that its equivalent algebraic semantics is definitionally equivalent to the quasivariety of BCK-algebras generated by the BCK-chains. We propose the concept of "linearization of a system" and we give some examples. 相似文献
62.
63.
Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson and Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality.In part III we discuss applications in logic of the framework developed. Specifically, logics with restricted structural rules give rise to lattices with normal operators (in our sense), such as the Full Lambek algebras (F L-algebras) studied by Ono in [36]. Our Stone-type representation results can be then used to obtain canonical constructions of Kripke frames for such systems, and to prove a duality of algebraic and Kripke semantics for such logics. 相似文献
64.
In this paper we continue the investigation of monadic Heyting algebras which we started in [2]. Here we present the representation theorem for monadic Heyting algebras and develop the duality theory for them. As a result we obtain an adequate topological semantics for intuitionistic modal logics over MIPC along with a Kripke-type semantics for them. It is also shown the importance and the effectiveness of the duality theory for further investigation of monadic Heyting algebras and logics over MIPC. 相似文献
65.
石恩林 《医学与哲学(人文社会医学版)》2005,(11)
世界上第一个克隆人不久将出现于世,法律应如何对待克隆人问题,已提上议事日程。我国应理性对待,允许有条件克隆人,并就有关立法提出了初步构想。 相似文献
66.
Defining a composition operation on sets of formulas one obtains a many-sorted algebra which satisfies the superassociative
law and one more identity. This algebra is called the clone of formulas of the given type. The interpretations of formulas
on an algebraic system of the same type form a many-sorted algebra with similar properties. The satisfaction of a formula
by an algebraic system defines a Galois connection between classes of algebraic systems of the same type and collections of
formulas. Hypersubstitutions are mappings sending pairs of operation symbols to pairs of terms of the corresponding arities
and relation symbols to formulas of the same arities. Using hypersubstitutions we define hyperformulas. Satisfaction of a
hyperformula by an algebraic system defines a second Galois connection between classes of algebraic systems of the same type
and collections of formulas. A class of algebraic systems is said to be solid if every formula which is satisfied is also
satisfied as a hyperformula. On the basis of these two Galois connections we construct a conjugate pair of additive closure
operators and are able to characterize solid classes of algebraic systems.
Presented by Wojciech Buszkowski 相似文献
67.
Dr. habil. Hans-Jürgen Hoehnke 《Studia Logica》2004,78(1-2):249-260
Quasi-equational logic concerns with a completeness theorem, i. e. a list of general syntactical rules such that, being given a set of graded quasi-equations Q, the closure Cl Q = Qeq Fun Q can be derived from
by the given rules. Those rules do exist, because our consideration could be embedded into the logic of first order language. But, we look for special (quasi-equational) rules. Suitable rules were already established for the (non-functorial) case of partial algebras in Definition 3.1.2 of [27], p. 108, and [28], p. 102. (For the case of total algebras, see [35].) So, one has to translate these rules to the (functorial) language of partial theories
.Surprisingly enough, partial theories can be replaced up to isomorphisms by partial Dale monoids (cf. Section 3), which, in the total case are ordinary monoids.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
68.
69.
ukasiewicz's four-valued modal logic is surveyed and analyzed, together with ukasiewicz's motivations to develop it. A faithful interpretation of it in classical (non-modal) two-valued logic is presented, and some consequences are drawn concerning its classification and its algebraic behaviour. Some counter-intuitive aspects of this logic are discussed in the light of the presented results, ukasiewicz's own texts, and related literature. 相似文献
70.
Ivor Grattan-Guinness 《Theology & Science》2013,11(1):137-147
An important feature of mathematics, both pure and applied, during the nineteenth century was the widening from its common form to a proliferation, where the “objects” studied were not numbers or geometrical magnitudes but operations such as functions and differentiation and integration, abstract ones (as we now call them), linear algebras of vectors, matrices and determinants, and algebras in logic. In this article the author considers several of them, including the contributions of Hermann Grassmann and Benjamin Peirce. A notable feature of these developments was analogising from one algebra to another by adopting some of the same laws, such as associativity, commutativity and distributivity. In the final section we consider the normally secular character of these algebras. 相似文献