10,897 research outputs found
Admissibility in Finitely Generated Quasivarieties
Checking the admissibility of quasiequations in a finitely generated (i.e.,
generated by a finite set of finite algebras) quasivariety Q amounts to
checking validity in a suitable finite free algebra of the quasivariety, and is
therefore decidable. However, since free algebras may be large even for small
sets of small algebras and very few generators, this naive method for checking
admissibility in \Q is not computationally feasible. In this paper,
algorithms are introduced that generate a minimal (with respect to a multiset
well-ordering on their cardinalities) finite set of algebras such that the
validity of a quasiequation in this set corresponds to admissibility of the
quasiequation in Q. In particular, structural completeness (validity and
admissibility coincide) and almost structural completeness (validity and
admissibility coincide for quasiequations with unifiable premises) can be
checked. The algorithms are illustrated with a selection of well-known finitely
generated quasivarieties, and adapted to handle also admissibility of rules in
finite-valued logics
State morphism MV-algebras
We present a complete characterization of subdirectly irreducible MV-algebras
with internal states (SMV-algebras). This allows us to classify subdirectly
irreducible state morphism MV-algebras (SMMV-algebras) and describe single
generators of the variety of SMMV-algebras, and show that we have a continuum
of varieties of SMMV-algebras
Structural and universal completeness in algebra and logic
In this work we study the notions of structural and universal completeness
both from the algebraic and logical point of view. In particular, we provide
new algebraic characterizations of quasivarieties that are actively and
passively universally complete, and passively structurally complete. We apply
these general results to varieties of bounded lattices and to quasivarieties
related to substructural logics. In particular we show that a substructural
logic satisfying weakening is passively structurally complete if and only if
every classical contradiction is explosive in it. Moreover, we fully
characterize the passively structurally complete varieties of MTL-algebras,
i.e., bounded commutative integral residuated lattices generated by chains.Comment: This is a preprin
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn is an example of a know-how representation. Such representations are argued to have their origin in a principle called the minimum duplication of resources. For most the subsequent discussions existence of colour name strategy suffices. It is pointed out that the Berlin†- Kay† universal partial ordering of colours and the frequency of traffic accidents classified by colour are surprisingly similar; a detailed analysis is not carried out as the specific colours recorded are not identical. Some consequences of the existence of a name strategy for the philosophy of language and mathematics are discussed: specifically it is argued that in accounts of truth and meaning it is necessary throughout to use real numbers as opposed to bi-valent quantities; and also that the concomitant label associated with sentences should not be of unconditional truth, but rather several real-valued quantities associated with visual communication. The implication of real-valued truth quantities is that the Continuum Hypothesis of pure mathematics is side-stepped, because real valued quantities occur ab initio. The existence of name strategy shows that thought/sememes and talk/phonemes can be separate, and this vindicates the assumption of thought occurring before talk used in psycho-linguistic speech production models.
Poset products as relational models
We introduce a relational semantics based on poset products, and provide
sufficient conditions guaranteeing its soundness and completeness for various
substructural logics. We also demonstrate that our relational semantics unifies
and generalizes two semantics already appearing in the literature: Aguzzoli,
Bianchi, and Marra's temporal flow semantics for H\'ajek's basic logic, and
Lewis-Smith, Oliva, and Robinson's semantics for intuitionistic Lukasiewicz
logic. As a consequence of our general theory, we recover the soundness and
completeness results of these prior studies in a uniform fashion, and extend
them to infinitely-many other substructural logics
Singly generated quasivarieties and residuated structures
A quasivariety K of algebras has the joint embedding property (JEP) iff it is
generated by a single algebra A. It is structurally complete iff the free
countably generated algebra in K can serve as A. A consequence of this demand,
called "passive structural completeness" (PSC), is that the nontrivial members
of K all satisfy the same existential positive sentences. We prove that if K is
PSC then it still has the JEP, and if it has the JEP and its nontrivial members
lack trivial subalgebras, then its relatively simple members all belong to the
universal class generated by one of them. Under these conditions, if K is
relatively semisimple then it is generated by one K-simple algebra. It is a
minimal quasivariety if, moreover, it is PSC but fails to unify some finite set
of equations. We also prove that a quasivariety of finite type, with a finite
nontrivial member, is PSC iff its nontrivial members have a common retract. The
theory is then applied to the variety of De Morgan monoids, where we isolate
the sub(quasi)varieties that are PSC and those that have the JEP, while
throwing fresh light on those that are structurally complete. The results
illuminate the extension lattices of intuitionistic and relevance logics
- …