In a previous work we studied, from the perspective ofAlgebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional implication (...) operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices. (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 paper authors for the first time define a new notion called neutrosophic lattices. We define few properties related with them. Three types of neutrosophic lattices are defined and the special properties about these new class of lattices are discussed and developed. This paper is organised into three sections. First section introduces the concept of partially ordered neutrosophic set and neutrosophic lattices. Section two introduces different types of neutrosophic lattices and the final section studies neutrosophic Boolean algebras. Conclusions and (...) results are provided in section three. (shrink)

A repository of clinically associated Staphylococcus aureus (Sa) isolates is used to semi‐automatically generate a set of application ontologies for specific subfamilies of Sa‐related disease. Each such application ontology is compatible with the Infectious Disease Ontology (IDO) and uses resources from the Open Biomedical Ontology (OBO) Foundry. The set of application ontologies forms a lattice structure beneath the IDO‐Core and IDO‐extension reference ontologies. We show how this lattice can be used to define a strategy for the construction of (...) a new taxonomy of infectious disease incorporating genetic, molecular, and clinical data. We also outline how faceted browsing and query of annotated data is supported using a lattice application ontology. (shrink)

We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...) be labelled a finitary, evidence-based, `agnostic' perspective and argue that Brouwerian atheism is merely a restricted perspective within the finitary agnostic perspective, whilst Hilbertian theism contradicts the finitary agnostic perspective. -/- We then consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary, evidence-based, definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways. -/- We show that the two definitions correspond to two distinctly different---not necessarily evidence-based but complementary---assignments of satisfaction and truth to the compound formulas of PA over N. -/- We further show that the PA axioms are true over N, and that the PA rules of inference preserve truth over N, under both the complementary interpretations; and conclude some unsuspected constructive consequences of such complementarity for the foundations of mathematics, logic, philosophy, and the physical sciences. -/- . (shrink)

The LIBOR Market Model has become one of the most popular models for pricing interest rate products. It is commonly believed that Monte-Carlo simulation is the only viable method available for the LIBOR Market Model. In this article, however, we propose a lattice approach to price interest rate products within the LIBOR Market Model by introducing a shifted forward measure and several novel fast drift approximation methods. This model should achieve the best performance without losing much accuracy. Moreover, the (...) calibration is almost automatic and it is simple and easy to implement. Adding this model to the valuation toolkit is actually quite useful; especially for risk management or in the case there is a need for a quick turnaround. (shrink)

A synthesis of trending topics in pancomputationalism. I introduce the notion that "strange loops" engender the most atomic levels of physical reality, and introduce a mechanism for global non-locality. Writen in a simple and accesssible style, it seeks to draw research in fundamental physics back to realism, and have a bit of fun in the process.

This paper focuses on order-preserving logics defined from varieties of distributive lattices with negation, and in particular on the problem of whether these can be axiomatized by means Hilbert-style calculi that are finite. On the negative side, we provide a syntactic condition on the equational presentation of a variety that entails failure of finite axiomatizability for the corresponding logic. An application of this result is that the logic of all distributive lattices with negation is not finitely axiomatizable; we likewise establish (...) that the order-preserving logic of the variety of all Ockham algebras is also not finitely axiomatizable. On the positive side, we show that an arbitrary subvariety of semi-De Morgan algebras is axiomatized by a finite number of equations if and only if the corresponding order-preserving logic is axiomatized by a finite Hilbert-style calculus. This equivalence also holds for every subvariety of a Berman variety of Ockham algebras. We obtain, as a corollary, a new proof that the implication-free fragment of intuitionistic logic is finitely axiomatizable, as well as a new corresponding Hilbert-style calculus. Our proofs are constructive in that they allow us to effectively convert an equational presentation of a variety of algebras into a Hilbert-style calculus for the corresponding order-preserving logic, and vice versa. We also consider the assertional logics associated to the above-mentioned varieties, showing in particular that the assertional logics of finitely axiomatizable subvarieties of semi-De Morgan algebras are finitely axiomatizable as well. (shrink)

As far as we know the scientific search for the nature of reality in Europe started about 2500 years ago in ancient Greek. It was the ancient Greek philosopher Parmenides who reasoned that observable reality is created by an underlying reality. There are indications that the ancient Greek concept of the atom was (also) related to the proposed units of the structure of the underlying creating reality of Parmenides. However, an invisible underlying creating reality suggests that we cannot determine its (...) existence with the help of experimental physics. This paper describes an experiment that will show that Parmenides concept about an underlying reality is correct. (shrink)

Observable consequences of the hypothesis that the observed universe is a numerical simulation performed on a cubic space-time lattice or grid are explored. The simulation scenario is first motivated by extrapolating current trends in computational resource requirements for lattice QCD into the future. Using the historical development of lattice gauge theory technology as a guide, we assume that our universe is an early numerical simulation with unimproved Wilson fermion discretization and investigate potentially-observable consequences. Among the observables that (...) are considered are the muon g-2 and the current differences between determinations of alpha, but the most stringent bound on the inverse lattice spacing of the universe, b−1 > ~ 10^11 GeV, is derived from the high-energy cut off of the cosmic ray spectrum. The numerical simulation scenario could reveal itself in the distributions of the highest energy cosmic rays exhibiting a degree of rotational symmetry breaking that reflects the structure of the underlying lattice. (shrink)

Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones for ordinary (...) quantifiers. We call them Π-logics. Taking S5Π, the smallest normal Π-logic extending S5, as the natural counterpart to S5 in Scroggs's theorem, we show that all normal Π-logics extending S5Π are complete with respect to their complete simple S5 algebras, that they form a lattice that is isomorphic to the lattice of the open sets of the disjoint union of two copies of the one-point compactification of N, that they have arbitrarily high Turing-degrees, and that there are non-normal Π-logics extending S5Π. (shrink)

The lattice operations of join and meet were defined for set partitions in the nineteenth century, but no new logical operations on partitions were defined and studied during the twentieth century. Yet there is a simple and natural graph-theoretic method presented here to define any n-ary Boolean operation on partitions. An equivalent closure-theoretic method is also defined. In closing, the question is addressed of why it took so long for all Boolean operations to be defined for partitions.

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of (...) rest and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises. (shrink)

K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...) properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock of (...) higher set theory the jewel of mathematical Continuum -- this genuine, even if mostly forgotten today raison d'etre of all set-theoretical enterprises to Infinity and beyond, from Georg Cantor to W. Hugh Woodin to Buzz Lightyear, by simultaneously exhibiting the limits and pitfalls of all old and new reductionist foundational approaches to mathematical truth: be it Cantor's or post-Cantorian Idealism, Brouwer's or post-Brouwerian Constructivism, Hilbert's or post-Hilbertian Formalism, Goedel's or post-Goedelian Platonism. -/- In the spirit of Zeno's paradoxes, but with the enormous historical advantage of hindsight, we claim that Cantor's set-theoretical methodology, powerful and reach in proof-theoretic and similar applications as it might be, is inherently limited by its epistemological framework of transfinite local causality, and neither can be held accountable for the properties of the Continuum already acquired through geometrical, analytical, and arithmetical studies, nor can it be used for an adequate, conceptually sensible, operationally workable, and axiomatically sustainable re-creation of the Continuum. -/- From a strictly mathematical point of view, this intrinsic limitation of the constative and explicative power of higher set theory finds its explanation in the identified in this study ultimate phenomenological obstacle to Cantor's transfinite construction, similar to topological obstacles in homotopy theory and theoretical physics: the entanglement capacity of the mathematical Continuum. (shrink)

We develop a Priestley-style duality theory for different classes of algebras having a bilattice reduct. A similar investigation has already been realized by B. Mobasher, D. Pigozzi, G. Slutzki and G. Voutsadakis, but only from an abstract category-theoretic point of view. In the present work we are instead interested in a concrete study of the topological spaces that correspond to bilattices and some related algebras that are obtained through expansions of the algebraic language.

Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms (...) of ZF, and can be expanded with a paraconsistent negation *, thus obtaining a paraconsistent model of ZF. The logic (PS3 ,*) coincides (up to language) with da Costa and D'Ottaviano logic J3, a 3-valued paraconsistent logic that have been proposed independently in the literature by several authors and with different motivations such as CluNs, LFI1 and MPT. We propose in this paper a family of algebraic models of ZFC based on LPT0, another linguistic variant of J3 introduced by us in 2016. The semantics of LPT0, as well as of its first-order version QLPT0, is given by twist structures defined over Boolean agebras. From this, it is possible to adapt the standard Boolean-valued models of (classical) ZFC to twist-valued models of an expansion of ZFC by adding a paraconsistent negation. We argue that the implication operator of LPT0 is more suitable for a paraconsistent set theory than the implication of PS3, since it allows for genuinely inconsistent sets w such that [(w = w)] = 1/2 . This implication is not a 'reasonable implication' as defined by Löwe and Tarafder. This suggests that 'reasonable implication algebras' are just one way to define a paraconsistent set theory. Our twist-valued models are adapted to provide a class of twist-valued models for (PS3,*), thus generalizing Löwe and Tarafder result. It is shown that they are in fact models of ZFC (not only of ZF). (shrink)

Quasi-Nelson logic (QNL) was recently introduced as a common generalisation of intuitionistic logic and Nelson's constructive logic with strong negation. Viewed as a substructural logic, QNL is the axiomatic extension of the Full Lambek Calculus with Exchange and Weakening by the Nelson axiom, and its algebraic counterpart is a variety of residuated lattices called quasi-Nelson algebras. Nelson's logic, in turn, may be obtained as the axiomatic extension of QNL by the double negation (or involutivity) axiom, and intuitionistic logic as the (...) extension of QNL by the contraction axiom. A recent series of papers by the author and collaborators initiated the study of fragments of QNL, which correspond to subreducts of quasi-Nelson algebras. In the present paper we focus on fragments that contain the connectives forming a residuated pair (the monoid conjunction and the so-called strong Nelson implication), these being the most interesting ones from a substructural logic perspective. We provide quasi-equational (whenever possible, equational) axiomatisations for the corresponding classes of algebras, obtain twist representations for them, study their congruence properties and take a look at a few notable subvarieties. Our results specialise to the involutive case, yielding characterisations of the corresponding fragments of Nelson's logic and their algebraic counterparts. (shrink)

The Belnap–Dunn logic is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point (...) of view ofAlgebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies. (shrink)

A recent paper by Jakl, Jung and Pultr succeeded for the first time in establishing a very natural link between bilattice logic and the duality theory of d-frames and bitopological spaces. In this paper we further exploit, extend and investigate this link from an algebraic and a logical point of view. In particular, we introduce classes of algebras that extend bilattices, d-frames and N4-lattices to a setting in which the negation is not necessarily involutive, and we study corresponding logics. We (...) provide product representation theorems for these algebras, as well as completeness, algebraizability results for the corresponding logics. (shrink)

This paper offers a positive account of an important but under-explored class of mental states, non-propositional attitudes such as loving one’s department, liking lattice structures, fearing Freddy Krueger, and hating Sherlock Holmes. In broadest terms, the view reached is a representationalist account guided by two puzzles. The proposal allows one to say in an elegant way what differentiates a propositional attitude from an attitude merely about a proposition. The proposal also allows one to offer a unified account of the (...) non-propositional attitudes that captures both empty and non-empty cases by properly locating the posited representations in the metaphysical structure of the attitudes. (shrink)

Recent discussions of emergence in physics have focussed on the use of limiting relations, and often particularly on singular or asymptotic limits. We discuss a putative example of emergence that does not fit into this narrative: the case of phonons. These quasi-particles have some claim to be emergent, not least because the way in which they relate to the underlying crystal is almost precisely analogous to the way in which quantum particles relate to the underlying quantum field theory. But there (...) is no need to take a limit when moving from a crystal lattice based description to the phonon description. Not only does this demonstrate that we can have emergence without limits, but also provides a way of understanding cases that do involve limits. (shrink)

Modern scientific cosmology pushes the boundaries of knowledge and the knowable. This is prompting questions on the nature of scientific knowledge. A central issue is what defines a 'good' model. When addressing global properties of the Universe or its initial state this becomes a particularly pressing issue. How to assess the probability of the Universe as a whole is empirically ambiguous, since we can examine only part of a single realisation of the system under investigation: at some point, data will (...) run out. We review the basics of applying Bayesian statistical explanation to the Universe as a whole. We argue that a conventional Bayesian approach to model inference generally fails in such circumstances, and cannot resolve, e.g., the so-called 'measure problem' in inflationary cosmology. Implicit and non-empirical valuations inevitably enter model assessment in these cases. This undermines the possibility to perform Bayesian model comparison. One must therefore either stay silent, or pursue a more general form of systematic and rational model assessment. We outline a generalised axiological Bayesian model inference framework, based on mathematical lattices. This extends inference based on empirical data (evidence) to additionally consider the properties of model structure (elegance) and model possibility space (beneficence). We propose this as a natural and theoretically well-motivated framework for introducing an explicit, rational approach to theoretical model prejudice and inference beyond data. (shrink)

This paper investigates some classical oppositional categories, like synthetic vs. analytic, posterior vs. prior, imagination vs. grammar, metaphor vs. hermeneutics, metaphysics vs. observation, innovation vs. routine, and image vs. sound, and the role they play in epistemology and philosophy of science. The epistemological framework of objective cognitive constructivism is of special interest in these investigations. Oppositional relations are formally represented using algebraic lattice structures like the cube and the hexagon of opposition, with applications in the contexts of modern color (...) theory, Kantian philosophy, Jungian psychology, and linguistics. (shrink)

This paper develops a theory of propositional identity which distinguishes necessarily equivalent propositions that differ in subject-matter. Rather than forming a Boolean lattice as in extensional and intensional semantic theories, the space of propositions forms a non-interlaced bilattice. After motivating a departure from tradition by way of a number of plausible principles for subject-matter, I will provide a Finean state semantics for a novel theory of propositions, presenting arguments against the convexity and nonvacuity constraints which Fine (2016, 2017a,b) introduces. (...) I will then move to compare the resulting logic of propositional identity (PI) with Correia’s (2016) logic of generalised identity (GI), as well as the first degree fragment of Angell’s (1989) logic of analytic containment (AC). The paper concludes by extending PI to include axioms and rules for a subject-matter operator, providing a much broader theory of subject-matter than the principles with which I will begin. (shrink)

Bilattices, introduced by Ginsberg as a uniform framework for inference in artificial intelligence, are algebraic structures that proved useful in many fields. In recent years, Arieli and Avron developed a logical system based on a class of bilattice-based matrices, called logical bilattices, and provided a Gentzen-style calculus for it. This logic is essentially an expansion of the well-known Belnap–Dunn four-valued logic to the standard language of bilattices. Our aim is to study Arieli and Avron’s logic from the perspective of abstract (...) algebraic logic . We introduce a Hilbert-style axiomatization in order to investigate the properties of the algebraic models of this logic, proving that every formula can be reduced to an equivalent normal form and that our axiomatization is complete w.r.t. Arieli and Avron’s semantics. In this way, we are able to classify this logic according to the criteria of AAL. We show, for instance, that it is non-protoalgebraic and non-self-extensional. We also characterize its Tarski congruence and the class of algebraic reducts of its reduced generalized models, which in the general theory of AAL is usually taken to be the algebraic counterpart of a sentential logic. This class turns out to be the variety generated by the smallest non-trivial bilattice, which is strictly contained in the class of algebraic reducts of logical bilattices. On the other hand, we prove that the class of algebraic reducts of reduced models of our logic is strictly included in the class of algebraic reducts of its reduced generalized models. Another interesting result obtained is that, as happens with some implicationless fragments of well-known logics, we can associate with our logic a Gentzen calculus which is algebraizable in the sense of Rebagliato and Verdú . We also prove some purely algebraic results concerning bilattices, for instance that the variety of distributive bilattices is generated by the smallest non-trivial bilattice. This result is based on an improvement of a theorem by Avron stating that every bounded interlaced bilattice is isomorphic to a certain product of two bounded lattices. We generalize it to the case of unbounded interlaced bilattices. (shrink)

We introduce a new product bilattice con- struction that generalizes the well-known one for interlaced bilattices and others that were developed more recently, allowing to obtain a bilattice with two residuated pairs as a certain kind of power of an arbitrary residuated lattice. We prove that the class of bilattices thus obtained is a variety, give a finite axiomatization for it and characterize the congruences of its members in terms of those of their lat- tice factors. Finally, we show (...) how to employ our product construction to define first-order definable classes of bi- lattices corresponding to any first-order definable subclass of residuated lattices. (shrink)

The paper contains some algebraic results on several varieties of algebras having an (interlaced) bilattice reduct. Some of these algebras have already been studied in the literature (for instance bilattices with conflation, introduced by M. Fit- ting), while others arose from the algebraic study of O. Arieli and A. Avron’s bilattice logics developed in the third author’s PhD dissertation. We extend the representation theorem for bounded interlaced bilattices (proved, among others, by A. Avron) to un- bounded bilattices and prove analogous (...) representation theorems for the other classes of bilattices considered. We use these results to establish categorical equivalences between these structures and well-known varieties of lattices. (shrink)

Prompted by the thesis that an organism’s umwelt possesses not just a descriptive dimension, but a normative one as well, some have sought to annex semiotics with ethics. Yet the pronouncements made in this vein have consisted mainly in rehearsing accepted moral intuitions, and have failed to concretely further our knowledge of why or how a creature comes to order objects in its environment in accordance with axiological charges of value or disvalue. For want of a more explicit account, theorists (...) writing on the topic have relied almost exclusively on semiotic insights about perception originally designed as part of a sophisticated refutation of idealism. The end result, which has been a form of direct givenness, has thus been far from convincing. In an effort to bring substance to the right-headed suggestion that values are rooted in the biological and conform to species-specific requirements, we present a novel conception that strives to make explicit the elemental structure underlying umwelt normativity. Building and expanding on the seminal work of Ayn Rand in metaethics, we describe values as an intertwined lattice which takes a creature’s own embodied life as its ultimate standard; and endeavour to show how, from this, all subsequent valuations can in principle be determined. (shrink)

All the cards seem to be stacked against belief in immortality. Nonetheless, the resources of particular religious traditions may avail where generic philosophical solutions fall short. With attention to the boredom and narcissism critiques, intimations of deathlessness in Śāntideva's radical altruism, and recent Christian debates on the soul and the intermediate state, I propose two criteria for a coherent religion-specific belief in immortality: (1) the belief is supported by a fully realized religious tradition, (2) the belief satisfies the demand for (...) self-transcendence as well as for self-preservation. Where self-transcendence and self-preservation are kept in balance, and where the whole idea rests upon the lattice-work of a fully realized religious tradition, immortality is a fitting object of belief. Moreover, such belief is compatible with considerable speculative freedom concerning matter and spirit, body and soul, and personal identity over time. (shrink)

Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be interpreted. (...) The correspondence can be further extended to the foundation of mathematics by set theory and arithmetic, and thus to all mathematics. (shrink)

Besides the better-known Nelson logic and paraconsistent Nelson logic, in 1959 David Nelson introduced, with motivations of realizability and constructibility, a logic called $\mathcal{S}$. The logic $\mathcal{S}$ was originally presented by means of a calculus with infinitely many rule schemata and no semantics. We look here at the propositional fragment of $\mathcal{S}$, showing that it is algebraizable, in the sense of Blok and Pigozzi, with respect to a variety of three-potent involutive residuated lattices. We thus introduce the first known algebraic (...) semantics for $\mathcal{S}$ as well as a finite Hilbert-style calculus equivalent to Nelson’s presentation; this also allows us to clarify the relation between $\mathcal{S}$ and the other two Nelson logics $\mathcal{N}3$ and $\mathcal{N}4$. (shrink)

We study the origin of quantum probabilities as arising from non-Boolean propositional-operational structures. We apply the method developed by Cox to non distributive lattices and develop an alternative formulation of non-Kolmogorovian probability measures for quantum mechanics. By generalizing the method presented in previous works, we outline a general framework for the deduction of probabilities in general propositional structures represented by lattices (including the non-distributive case).

This paper introduces the category of b-frames as a new tool in the study of complete lattices. B-frames can be seen as a generalization of posets, which play an important role in the representation theory of Heyting algebras, but also in the study of complete Boolean algebras in forcing. This paper combines ideas from the two traditions in order to generalize some techniques and results to the wider context of complete lattices. In particular, we lift a representation theorem of Allwein (...) and MacCaull to a duality between complete lattices and b-frames, and we derive alternative characterizations of several classes of complete lattices from this duality. This framework is then used to obtain new results in the theory of complete Heyting algebras and the semantics of intuitionistic propositional logic. (shrink)

If phenomenal consciousness is illusory and reduces to a perceptual interface between a belief-driven ego system and a lattice platform of both singular and hybrid connectionally-constructed concepts where phenomena themselves are sensation- induced constructs of complexes of things in the world then in order to communicate in terms of true meanings we would require a translation system between the complexes of things that have importance for creatures of different biologies whether evolved or synthetic. In this paper I investigate and (...) propose an ontological scheme that can act in some way to bridge this gap and potentially allow humans to talk with robots about themselves and the world. (shrink)

In this paper we discuss the notions of adequacy and truth functionality in quantum logic from the point of view of a non-deterministic semantics. We give a characterization of the degree of non-functionality which is compatible with the propositional structure of quantum theory, showing that having truth-functional connectives, together with some assumptions regarding the relation of logical consequence, commits us to the adequacy of the interpretation sets of these connectives. An advantage of our proof is that it is independent of (...) the number of truth values involved, generalizing previous works. We also show the failure of the adequacy of every Nmatrix that is a model of the non-distributive lattice of quantum propositions. En este trabajo discutimos las nociones de adecuación y veritativo-funcionalidad en la lógica cuántica, desde el punto de vista de una semántica no determinista. Damos una caracterización del grado de no-funcionalidad compatible con la estructura proposicional de la teoría cuántica, mostrando que tener conectivos veritativo-funcionales, junto con algunos presupuestos relativos a la relación de consecuencia lógica, nos compromete con la adecuación de los conjuntos de interpretación de estos conectivos. Un punto ventajoso de nuestra prueba es que se independiza de la cantidad de valores de verdad involucrados, generalizando trabajos previos. Probamos también que falla la adecuación de cualquier Nmatriz que sirva como modelo para el retículo no distributivo de proposiciones cuánticas. (shrink)

Biological order provided by α-helical secondary protein structures is an important resource exploitable by living organisms for increasing the efficiency of energy transport. In particular, self-trapping of amide I energy quanta by the induced phonon deformation of the hydrogen-bonded lattice of peptide groups is capable of generating either pinned or moving solitary waves following the Davydov quasiparticle/soliton model. The effect of applied in-phase Gaussian pulses of amide I energy, however, was found to be strongly dependent on the site of (...) application. Moving solitons were only launched when the amide I energy was applied at one of the α-helix ends, whereas pinned solitons were produced in the α-helix interior. In this paper, we describe a general mechanism that launches moving solitons in the interior of the α-helix through phase-modulated Gaussian pulses of amide I energy. We also compare the predicted soliton velocity based on effective soliton mass and the observed soliton velocity in computer simulations for different parameter values of the isotropy of the exciton-phonon interaction. The presented results demonstrate the capacity for explicit control of soliton velocity in protein α-helices, and further support the plausibility of gradual optimization of quantum dynamics for achieving specialized protein functions through natural selection. (shrink)

This paper (i) gives necessary and sufficient conditions that clocks in an inertial lattice can be synchronized, (ii) shows that these conditions do not imply a universal light speed, and (iii) shows that the terrestrial redshift experiment provides evidence that clocks in a small inertial lattice in a gravitational field can be synchronized.

According to the BSM- Supergravitation Unified Theory (BSM-SG), the energy is indispensable feature of matter, while the matter possesses hierarchical levels of organization from a simple to complex forms, with appearance of fields at some levels. Therefore, the energy also follows these levels. At the fundamental level, where the primary energy source exists, the matter is in its primordial form, where two super-dense fundamental particles (FP) exist in a classical pure empty space (not a physical vacuum). They are associated with (...) the Planck scale parameters of frequency and distance and interact by Supergravitational forces. These forces are inverse proportional to the cube of distance at pure empty space and they are based on frequency interactions. Since the two FPs have different intrinsic frequencies, the SG forces appear different for interactions between the like and unlike FPs and may change the sign. This primordial form of matter exists in the super-heavy black holes located in the center of each well formed galaxy. The next upper level of matter organization includes the underlying structure of the physical vacuum, called a Cosmic Lattice, and the structure of elementary particles. They have common substructure elements obtained by specific crystallization process preceding the formation of the observable galaxies. The Cosmic Lattice, forming a space known as a physical vacuum, is responsible for the existence and propagation of the physical fields: electrical, magnetic, Newtonian gravity and inertia. The energy of physical vacuum is in two forms: Static (enormous) and Dynamic (weak). The Static energy is directly related to the Newtonian mass by the Einstein equation E = mc^2 and it is a primary source of the nuclear energy. The Dynamic energy is responsible for the existence of the electric and magnetic fields, the constant speed of light and the quantum mechanical properties of the physical vacuum. The next upper energy level is the dynamical energy of excited atoms and molecules. At this level a hidden energy wells exit, such as the internal energy of the electron and the internal energy of atoms with more than one electron. The next upper energy level is at some organic molecules and particularly in the biomolecules that contain ring atomic structures. In such a structure, some quantum states are not emitted immediately, but rotating in the ring. While in organic molecules the energy stored in such a ring is released by a chemical process, in the long chain molecule of proteins in the living organism the stored energy can be released simultaneously by triggering. A huge number of atomic rings are contained in the DNA strands. The release of the energy stored in DNA, for example, is an avalanche process that causes an emission of entangled photons possessing a strong penetrating capability. A sequence of entangled photons emitted by DNA should carry the genetic information encoded by the cordons. This mechanism, predicted in BSM-SG theory, is very important for intercommunication between the cells of the living organism. The next upper level of energy organization may exist in the brain. The brain is an organ of a most abundant number of atomic rings, while its tissue environment might permit complex energy interactions. The human brain contains billions of atomic rings. The next hypothetical upper level of energy organization is an information field, physically existed outside, but connected with the living brain. It corresponds to a specific field known as aura, while the possibility of its existence is still not accepted by the main stream science. The problem is that this field could not be detected by the currently existing technical means used for EM communications. The BSM-SG predicts that this field might differ from the EM field we use for communication, but it is a subject of a further theoretical development that must be supported by experiments using specifically designed technical means. According to the BSM-SG theory, the energy conversion from the primary energy source to the complex levels of matter and field organization is a permanent syntropic process based on complex resonance interactions. (shrink)

This thesis examines the prospects for mechanical procedures that can identify true, complete, universal, first-order logical theories on the basis of a complete enumeration of true atomic sentences. A sense of identification is defined that is more general than those which are usually studied in the learning theoretic and inductive inference literature. Some identification algorithms based on confirmation relations familiar in the philosophy of science are presented. Each of these algorithms is shown to identify all purely universal theories without function (...) symbols. It is demonstrated that no procedure can solve this universal theory inference problem in the more usual senses of identification. The question of efficiency for theory inference systems is addressed, and some definitions of limiting complexity are examined. It is shown that several aspects of obvious strategies for solving the universal theory inference problem are NP-hard. Finally, some non-worst case heuristic search strategies are examined in light of these NP-completeness results. These strategies are based upon an isomorphism between clausal entailments of a certain class and partition lattices, and are applicable to the improvement of earlier work on language acquisition and logical inductive inference. (shrink)

Protein α-helices provide an ordered biological environment that is conducive to soliton-assisted energy transport. The nonlinear interaction between amide I excitons and phonon deformations induced in the hydrogen-bonded lattice of peptide groups leads to self-trapping of the amide I energy, thereby creating a localized quasiparticle (soliton) that persists at zero temperature. The presence of thermal noise, however, could destabilize the protein soliton and dissipate its energy within a finite lifetime. In this work, we have computationally solved the system of (...) stochastic differential equations that govern the quantum dynamics of protein solitons at physiological temperature, T=310 K, for either a single isolated α-helix spine of hydrogen bonded peptide groups or the full protein α-helix comprised of three parallel α-helix spines. The simulated stochastic dynamics revealed that although the thermal noise is detrimental for the single isolated α-helix spine, the cooperative action of three amide I exciton quanta in the full protein α-helix ensures soliton lifetime of over 30 ps, during which the amide I energy could be transported along the entire extent of an 18-nm-long α-helix. Thus, macromolecular protein complexes, which are built up of protein α-helices could harness soliton-assisted energy transport at physiological temperature. Because the hydrolysis of a single adenosine triphosphate molecule is able to initiate three amide I exciton quanta, it is feasible that multiquantal protein solitons subserve a variety of specialized physiological functions in living systems. (shrink)

The first aim of this note is to describe an algebraic structure, more primitive than lattices and quantales, which corresponds to the intuitionistic flavour of Linear Logic we prefer. This part of the note is a total trivialisation of ideas from category theory and we play with a toy-structure a not distant cousin of a toy-language. The second goal of the note is to show a generic categorical construction, which builds models for Linear Logic, similar to categorical models GC of (...) [deP1990], but more general. The ultimate aim is to relate different categorical models of linear logic. (shrink)

dialectical frameworks have been introduced as a formalism for modeling argumentation allowing general logical satisfaction conditions and the relevant argument evaluation. Different criteria used to settle the acceptance of arguments are called semantics. Semantics of ADFs have so far mainly been defined based on the concept of admissibility. However, the notion of strongly admissible semantics studied for abstract argumentation frameworks has not yet been introduced for ADFs. In the current work we present the concept of strong admissibility of interpretations for (...) ADFs. Further, we show that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as the maximal element. We also present algorithms to answer the following decision problems: whether a given interpretation is a strongly admissible interpretation of a given ADF, and whether a given argument is strongly acceptable/deniable in a given interpretation of a given ADF. In addition, we show that the strongly admissible semantics of ADFs forms a proper generalization of the strongly admissible semantics of AFs. (shrink)