共查询到20条相似文献,搜索用时 15 毫秒
1.
We present some equivalent conditions for a quasivariety of structures to be generated by a single structure. The first such condition, called the embedding property was found by A.I. Mal′tsev in [6]. It says that if are nontrivial, then there exists such that A and B are embeddable into C. One of our equivalent conditions states that the set of quasi-identities valid in is closed under a certain Gentzen type rule which is due to J. Łoś and R. Suszko [5].
Presented by Jacek Malinowski 相似文献
2.
Radomír Halaš 《Studia Logica》2008,89(1):19-35
It has been recently shown [4] that the lattice effect algebras can be treated as a subvariety of the variety of so-called
basic algebras. The open problem whether all subdirectly irreducible distributive lattice effect algebras are just subdirectly
irreducible MV-chains and the horizontal sum of two 3-element chains is in the paper transferred into a more tractable one. We prove that modulo distributive lattice
effect algebras, the variety generated by MV-algebras and is definable by three simple identities and the problem now is to check if these identities are satisfied by all distributive
lattice effect algebras or not.
Presented by Daniele Mundici 相似文献
3.
Sato Kentaro 《Studia Logica》2008,88(2):295-324
We study filters in residuated structures that are associated with congruence relations (which we call -filters), and develop a semantical theory for general substructural logics based on the notion of primeness for those filters.
We first generalize Stone’s sheaf representation theorem to general substructural logics and then define the primeness of
-filters as being “points” (or stalkers) of the space, the spectrum, on which the representing sheaf is defined. Prime FL-filters
will turn out to coincide with truth sets under various well known semantics for certain substructural logics. We also investigate
which structural rules are needed to interpret each connective in terms of prime -filters in the same way as in Kripke or Routley-Meyer semantics. We may consider that the set of the structural rules that
each connective needs in this sense reflects the difficulty of giving the meaning of the connective. A surprising discovery
is that connectives , ⅋ of linear logic are linearly ordered in terms of the difficulty in this sense.
Presented by Wojciech Buszkowski 相似文献
4.
We investigate an expansion of quasi-MV algebras ([10]) by a genuine quantum unary operator. The variety of such
quasi-MV algebras has a subquasivariety whose members—called cartesian—can be obtained in an appropriate way out of MV algebras. After showing that cartesian . quasi-MV algebras generate ,we prove a standard completeness theorem for w.r.t. an algebra over the complex numbers.
Presented by Heinrich Wansing 相似文献
5.
Miklós Ferenczi 《Studia Logica》2007,87(1):1-11
It is known that every α-dimensional quasi polyadic equality algebra (QPEA
α
) can be considered as an α-dimensional cylindric algebra satisfying the merrygo- round properties . The converse of this proposition fails to be true. It is investigated in the paper how to get algebras in QPEA from algebras
in CA. Instead of QPEA the class of the finitary polyadic equality algebras (FPEA) is investigated, this class is definitionally
equivalent to QPEA. It is shown, among others, that from every algebra in a β-dimensional algebra can be obtained in QPEA
β
where , moreover the algebra obtained is representable in a sense.
Presented by Daniele Mundici
Supported by the OTKA grants T0351192, T43242. 相似文献
6.
First we show that the classical two-player semantic game actually corresponds to a three-valued logic. Then we generalize
this result and give an n-player semantic game for an n + 1-valued logic with n binary connectives, each associated with a player. We prove that player i has a winning strategy in game if and only if the truth value of is t
i
in the model M, for 1 ≤ i ≤ n; and none of the players has a winning strategy in if and only if the truth value of is t
0 in M. 相似文献
7.
Tarek Sayed Ahmed 《Studia Logica》2007,85(2):139-151
SC, CA, QA and QEA denote the class of Pinter’s substitution algebras, Tarski’s cylindric algebras, Halmos’ quasi-polyadic
and quasi-polyadic equality algebras, respectively. Let . and . We show that the class of n dimensional neat reducts of algebras in K
m
is not elementary. This solves a problem in [2]. Also our result generalizes results proved in [1] and [2].
Presented by Robert Goldblatt 相似文献
8.
Alexander Budkin 《Studia Logica》2004,78(1-2):107-127
The dominion of a subalgebra H in an universal algebra A (in a class
) is the set of all elements
such that for all homomorphisms
if f, g coincide on H, then af = ag. We investigate the connection between dominions and quasivarieties. We show that if a class
is closed under ultraproducts, then the dominion in
is equal to the dominion in a quasivariety generated by
. Also we find conditions when dominions in a universal algebra form a lattice and study this lattice.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
9.
Fernando Guzmán 《Studia Logica》1994,53(2):243-257
Conditional logic is the deductive system
, where
is the set of propositional connectives {, ,} and is the structural finitary consequence relation on the absolutely free algebra
that preserves degrees of truth over the structure of truth values C, . HereC is the non-commutative regular extension of the 2-element Boolean algebra to 3 truth values {t, u, f}, andf<u<t. In this paper we give a Gentzen type axiomatization for conditional logic.Presented byJan Zygmunt 相似文献
10.
11.
J. Michael Dunn 《Studia Logica》1979,38(2):149-169
Given classical (2 valued) structures
and
and a homomorphism h of
onto
, it is shown how to construct a (non-degenerate) 3-valued counterpart
of
. Classical sentences that are true in
are non-false in
. Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). 相似文献
12.
Let
be a finite collection of finite algebras of finite signature such that SP(
) has meet semi-distributive congruence lattices. We prove that there exists a finite collection
1 of finite algebras of the same signature,
, such that SP(
1) is finitely axiomatizable.We show also that if
, then SP(
1) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract indicates.While working on this paper, the first author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA) grant no. T37877 and the second author was supported by the US National Science Foundation grant no. DMS-0245622.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
13.
A logic of intention and attempt 总被引:3,自引:1,他引:2
We present a modal logic called (logic of intention and attempt) in which we can reason about intention dynamics and intentional action execution. By exploiting
the expressive power of , we provide a formal analysis of the relation between intention and action and highlight the pivotal role of attempt in action execution. Besides, we deal with the problems of instrumental reasoning and intention persistence. 相似文献
14.
Xuefeng Wen 《Studia Logica》2007,85(2):251-260
We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one.
We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic
models. We also show that PLRI can be used to give a partial solution to the paradox of analysis.
Presented by Jacek Malinowski 相似文献
15.
Two groups of agents, and , face a moral conflict if has a moral obligation and has a moral obligation, such that these obligations cannot both be fulfilled. We study moral conflicts using a multi-agent
deontic logic devised to represent reasoning about sentences like ‘In the interest of group of agents, group of agents ought to see to it that .’ We provide a formal language and a consequentialist semantics. An illustration of our semantics with an analysis of the
Prisoner’s Dilemma follows. Next, necessary and sufficient conditions are given for (1) the possibility that a single group
of agents faces a moral conflict, for (2) the possibility that two groups of agents face a moral conflict within a single
moral code, and for (3) the possibility that two groups of agents face a moral conflict. 相似文献
16.
R. Gregory Taylor 《Journal of Philosophical Logic》2008,37(6):575-591
Symmetric propositions over domain and signature are characterized following Zermelo, and a correlation of such propositions with logical type- quantifiers over is described. Boolean algebras of symmetric propositions over and Σ are shown to be isomorphic to algebras of logical type- quantifiers over . This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only
those invariant under domain permutations. 相似文献
17.
Jarosław Achinger 《Studia Logica》1986,45(3):293-300
Universality of generalized Alexandroff's cube
plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube.
is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power
.Condition P(, ,
) says that
is a closure space of all , -filters in the lattice (
),
.Assuming that P (, ,
) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, ,
) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, ,
) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , ,
such that P (, ,
) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (,
1, 2
) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated. 相似文献
18.
The lattices of varieties were studied in many works (see [4], [5], [11], [24], [31]). In this paper we describe the lattice
of all subvarieties of the variety defined by so called externally compatible identities of Abelian groups and the identity x
n
≈ y
n
.
The notation in this paper is the same as in [2].
Presented by W. Dziobiak 相似文献
19.
An algebra A is said to be congruence coherent if every subalgebra of A that contains a class of some congruence on A is a union of -classes. This property has been investigated in several varieties of lattice-based algebras. These include, for example,
de Morgan algebras, p-algebras, double p-algebras, and double MS-algebras. Here we determine precisely when the property holds in the class of symmetric extended
de Morgan algebras.
Presented by M.E. Adams 相似文献
20.
This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language
with a distinguished unary predicate c(x), function-symbols , · and – and constants 0 and 1 is defined. An interpretation
for
is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as region x is connected and the function-symbols and constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation
based on the real closed plane which turns out to be isomorphic to
A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation. 相似文献