The Gibbs states of binary lattice systems can be characterized by their stability with respect to certain microscopic transitions which have a simple physical interpretation. A detailed analysis is provided for the case of a one-dimensional lattice gas with nearest-neighbor interactions.

Hume offers two ways of reconciling the partiality of people’s feelings with the generality of moral thinking. First, the general point of view in moral evaluation is not that of a disinterested observer, but of another person who has a close relationship with the person to be judged. Here I find something analogous to the idea of Nel Noddings, who attempts to build an ethical theory on the basis of caring relationships. Second, according to Hume, the generality of the rules (...) of justice is also compatible with partial feelings. Such rules allow everyone to pursue his or her goals without fear of violent intervention from others. My idea is that these rules are comparable to those of a competitive game. The idea of fair competition is not necessarily alien to Noddings’ type of ethical theory. As children, human beings normally learn to be fair in competitive games, along with caring for family members and friends. An ethical ideal of fairness may develop through competitions and help people get along with others beyond narrow circles. Taking into account of the competitive elements in relationship between people will be helpful in giving a fuller picture of a broadly Humean, sentimentalist ethical theory. (shrink)

In comparing humans and animals, we may use humans as the standard to measure animals, or conversely, animals as the standard to measure humans. While most philosophers have adopted the former approach, David Hume is among those few who use the comparison with animals as means to throw light on human nature. I focus on Hume’s treatment of human and animal reason. The cognitive processes and states that Hume holds to be common to humans and animals may be called situated, (...) that is, embedded in the process of guiding actions that is actually going on and consequently relative to the agent’s current position in space-time. Hume’s treatment of causal reasoning underlines the centrality of situated cognition in the workings of human, as well as animal minds. Taking situated reasoning and beliefs as the paradigm of human cognition enables us to look from an alternative point of view, at the features supposedly unique to human cognition, like the use of general words and concepts. Thus we can find a confirmation of the practical import of general words and concepts in Hume’s account of the obligation of promises, where words play an essential role in extending our control over objects and actions beyond what is present and particular into what is absent or not yet actualized. This is also a confirmation of how deeply our cognitive abilities in general are rooted in our practical needs. (shrink)

Bell’s theorem admits several interpretations or ‘solutions’, the standard interpretation being ‘indeterminism’, a next one ‘nonlocality’. In this article two further solutions are investigated, termed here ‘superdeterminism’ and ‘supercorrelation’. The former is especially interesting for philosophical reasons, if only because it is always rejected on the basis of extra-physical arguments. The latter, supercorrelation, will be studied here by investigating model systems that can mimic it, namely spin lattices. It is shown that in these systems the Bell inequality can be (...) violated, even if they are local according to usual definitions. Violation of the Bell inequality is retraced to violation of ‘measurement independence’. These results emphasize the importance of studying the premises of the Bell inequality in realistic systems. (shrink)

Knowledge of the entanglement properties of the wave functions commonly used to describe quantum many-particle systems can enhance our understanding of their correlation structure and provide new insights into quantum phase transitions that are observed experimentally or predicted theoretically. To illustrate this theme, we first examine the bipartite entanglement contained in the wave functions generated by microscopic many-body theory for the transverse Ising model, a system of Pauli spins on a lattice that exhibits an order-disorder magnetic quantum phase transition (...) under variation of the coupling parameter. Results for the single-site entanglement and measures of two-site bipartite entanglement are obtained for optimal wave functions of Jastrow-Hartree type. Second, we address the nature of bipartite and tripartite entanglement of spins in the ground state of the noninteracting Fermi gas, through analysis of its two- and three-fermion reduced density matrices. The presence of genuine tripartite entanglement is established and characterized by implementation of suitable entanglement witnesses and stabilizer operators. We close with a broader discussion of the relationships between the entanglement properties of strongly interacting systems of identical quantum particles and the dynamical and statistical correlations entering their wave functions. (shrink)

Recently it was shown that certain fluid-mechanical ‘pilot-wave’ systems can strikingly mimic a range of quantum properties, including single particle diffraction and interference, quantization of angular momentum etc. How far does this analogy go? The ultimate test of quantumness of such systems is a Bell-test. Here the premises of the Bell inequality are re-investigated for particles accompanied by a pilot-wave, or more generally by a resonant ‘background’ field. We find that two of these premises, namely outcome independence and measurement independence, (...) may not be generally valid when such a background is present. Under this assumption the Bell inequality is possibly violated. A class of hydrodynamic Bell experiments is proposed that could test this claim. Such a Bell test on fluid systems could provide a wealth of new insights on the different loopholes for Bell’s theorem. Finally, it is shown that certain properties of background-based theories can be illustrated in Ising spin-lattices. (shrink)

Recent investigation on the short-time dynamic scaling of critical dynamics is reviewed, with the aim of applying it to the field theory. The contents of this paper are as follows: (1) Short-time behavior of the critical relaxation dynamics, (2) Numerical evidence of the short-time scaling—2-dimensional Ising model and Universality, (3) Theoretical background of the generalized scaling form, (4) Application to a field theoretical model—(2+1)-dimensional SU(2) lattice gauge theory at finite temperature, and (5) Concluding remarks.

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis (...) that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures. (shrink)

We give a characterization of the fixed points and of the lattices of fixed points of fuzzy Galois connections. It is shown that fixed points are naturally interpreted as concepts in the sense of traditional logic.

This is also where we begin investigating lattices of logics and varieties, rather than particular examples.

We study the lattice of extensions of four-valued Belnap–Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and prove some new completeness theorems for super-Belnap logics. The crucial technical tool for this purpose will be the so-called antiaxiomatic (or explosive) part operator. The antiaxiomatic (or explosive) extensions of Belnap–Dunn logic turn out to be of particular interest owing to their connection to graph theory: the lattice (...) of finitary antiaxiomatic extensions of Belnap–Dunn logic is isomorphic to the lattice of upsets in the homomorphism order on finite graphs (with loops allowed). In particular, there is a continuum of finitary super-Belnap logics. Moreover, a non-finitary super-Belnap logic can be constructed with the help of this isomorphism. As algebraic corollaries we obtain the existence of a continuum of antivarieties of De Morgan algebras and the existence of a prevariety of De Morgan algebras which is not a quasivariety. (shrink)

Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK -lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK -lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK . Finally, we describe invariants determining a twist-structure (...) over a modal algebra. (shrink)

Lattice logic, bilattice logic, and paraconsistent quantum logic are investigated based on monosequent systems. Paraconsistent quantum logic is an extension of lattice logic, and bilattice logic is an extension of paraconsistent quantum logic. Monosequent system is a sequent calculus based on the restricted sequent that contains exactly one formula in both the antecedent and succedent. It is known that a completeness theorem with respect to a lattice-valued semantics holds for a monosequent system for lattice logic. A completeness theorem with respect (...) to a lattice-valued semantics is proved for paraconsistent quantum logic, and a completeness theorem with respect to a bilattice-valued semantics is proved for bilattice logic. Some syntactical properties, including cut-elimination and duality, are also investigated for the monosequent systems for these logics. (shrink)

In this paper a solution of Whitehead’s problem is presented: Starting with a purely mereological system of regions a topological space is constructed such that the class of regions is isomorphic to the Boolean lattice of regular open sets of that space. This construction may be considered as a generalized completion in analogy to the well-known Dedekind completion of the rational numbers yielding the real numbers . The argument of the paper relies on the theories of continuous lattices and (...) “pointless” topology.

. (shrink)

In this note we introduce and study algebras of type such that is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation. In addition, we characterize the congruences and the subalgebras of such an algebra. As an application, we will determine the Priestley spaces of quasi-Stone algebras.

The lattices of the title generalize the concept of a De Morgan lattice. A representation in terms of ordered topological spaces is described. This topological duality is applied to describe homomorphisms, congruences, and subdirectly irreducible and free lattices in the category. In addition, certain equational subclasses are described in detail.

A latarre is a lattice with an arrow. Its axiomatization looks natural. Latarres have a nontrivial theory which permits many constructions of latarres. Latarres appear as an end result of a series of generalizations of better known structures. These include Boolean algebras and Heyting algebras. Latarres need not have a distributive lattice.

Chapter 1: Introduction. S = <{We}c<w; C,U,n,0,w> is the substructure formed by restricting the lattice <^P(w); C , U, n,0,w> to the re subsets We of the ...

Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show that (...) there exists an immediate predecessor of classical logic (axiomatized by $p \leftrightarrow \square p$ ) which is not characterized by any finite algebra. The existence of modal logics having 2 ℵ 0 immediate predecessors is established. In contrast with these results we prove that the lattice of extensions of S4 behaves much better: a logic extending S4 is characterized by a finite algebra iff it has finitely many extensions and any such logic has only finitely many immediate predecessors, all of which are characterized by a finite algebra. (shrink)

In lattice theory the two well known equational class of lattices are the distributive lattices and the modular lattices. All distributive lattices are modular however a modular lattice in general is not distributive. In this book, new classes of lattices called supermodular lattices and semi-supermodular lattices are introduced and characterized.

A finitely alternative normal tense logic \ is a normal tense logic characterized by frames in which every point has at most n future alternatives and m past alternatives. The structure of the lattice \\) is described. There are \ logics in \\) without the finite model property, and only one pretabular logic in \\). There are \ logics in \\) which are not finitely axiomatizable. For \, there are \ logics in \\) without the FMP, and infinitely many pretabular (...) extensions of \. (shrink)

A lattice-valued set theory is formulated by introducing the logical implication $\to$ which represents the order relation on the lattice.

In this paper an algebraic system of the new type is proposed (namely, a vectorial lattice). This algebraic system is a lattice for the language of Aristotle’s syllogistic and as well as a lattice for the language of Vasiľév’s syllogistic. A lattice for the language of Aristotle’s syllogistic is called a vectorial lattice on cap-semilattice and a lattice for the language of Vasiľév’s syllogistic is called a vectorial lattice on closure cap-semilattice. These constructions are introduced for the first time.

Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes of so-called explosive, complete and classical Belnapian modal logics; • assigning to every normal modal logic three special conservative extensions in these classes; • associating with every Belnapian modal logic its explosive, complete and classical counterparts. We investigate the relationships between special extensions (...) and counterparts, provide certain handy characterisations and suggest a useful decomposition of the lattice of logics containing BK. (shrink)

This essay introduces the second of three installments of an “elegiac symposium” in Common Knowledge on figures and concepts devalued in what Thomas Kuhn refers to as “paradigm shifts.” The essay suggests that Kuhn’s idea is provincial, in three specified senses, and then goes on to show how differently Japanese culture regards and manages major change. The author of this introduction, who is also the journal’s editor, begins by evaluating a triptych of 1895 by Toshikata as a response to the (...) seemingly revolutionary changes brought by the Meiji Restoration a generation before. He then goes on to discuss, as exemplary of Japanese attitudes toward change, the Shinto ritual during which the sacred shrines of Ise Jingū are torn down and rebuilt every twenty years. The essay concludes by explaining how the impetus for this ritual is also involved in less-exalted aspects of Japanese culture; for example, in the peculiarities of the market for ukiyo-e woodblock prints. Overall, this essay shows that Japanese ways of regarding concepts such as “old” and “new,” “continuity” and “change,” differ so radically from those presupposed in the West that the latter should be regarded as provincial rather than as universally valid. (shrink)

The duality between congruence lattices of semilattices, and algebraic subsets of an algebraic lattice, is extended to include semilattices with operators. For a set G of operators on a semilattice S, we have \ \cong^{d} {{\rm S}_{p}}}\), where L is the ideal lattice of S, and H is a corresponding set of adjoint maps on L. This duality is used to find some representations of lattices as congruence lattices of semilattices with operators. It is also shown that (...) these congruence lattices satisfy the Jónsson–Kiefer property. (shrink)

A polymodal lattice is a distributive lattice carrying an n-place operator preserving top elements and certain finite meets. After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature. We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and completeness theorems.

Let $\mathcal{M}$ be an o-minimal expansion of a real closed field $R$. We define the notion of a lattice in a locally definable group and then prove that every connected, definably generated subgroup of $\langle R^{n},+\rangle$ contains a definable generic set and therefore admits a lattice.

The theory of concept lattices is approached from the point of view of fuzzy logic. The notions of partial order, lattice order, and formal concept are generalized for fuzzy setting. Presented is a theorem characterizing the hierarchical structure of formal fuzzy concepts arising in a given formal fuzzy context. Also, as an application of the present approach, Dedekind–MacNeille completion of a partial fuzzy order is described. The approach and results provide foundations for formal concept analysis of vague data—the propositions (...) “object x has attribute y”, which form the input data to formal concept analysis, are now allowed to have also intermediate truth values, meeting reality better. (shrink)