Hybrid identities are sentences in a special second order language with identity. The model classes of sets of hybrid identities are called hybrid solid varieties. We give a Birkhoff-type-characterization of hybrid solid varieties and develop a hybrid equational logic.

Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, (...) The completeness of the first-order functional calculus and Completeness in propositional type theory. More precisely, from and we take the idea of building the model described by the maximal consistent set; in our case the maximal consistent set has to be named, \-saturated and extensionally algebraic-saturated due to the hybrid and equational nature of \. From, we use the result that any element in the hierarchy has a name. The challenge was to deal with all the heterogeneous components in an integrated system. (shrink)

Equational hybrid propositional type theory ) is a combination of propositional type theory, equational logic and hybrid modal logic. The structures used to interpret the language contain a hierarchy of propositional types, an algebra and a Kripke frame. The main result in this paper is the proof of completeness of a calculus specifically defined for this logic. The completeness proof is based on the three proofs Henkin published last century: Completeness in type theory, (...) The completeness of the first-order functional calculus and Completeness in propositional type theory. More precisely, from and we take the idea of building the model described by the maximal consistent set; in our case the maximal consistent set has to be named, \-saturated and extensionally algebraic-saturated due to the hybrid and equational nature of \. From, we use the result that any element in the hierarchy has a name. The challenge was to deal with all the heterogeneous components in an integrated system. (shrink)

‘Hybrid’ theories of personal good, defended by e.g. Parfit, Wolf, and Kagan, equate it, not with a subjective state such as pleasure on its own, nor with an objective state such as knowledge on its own, but with a whole that supposedly combines the two. These theories apply Moore's principle of organic unities, which says the value of a whole needn't equal the sum of the values its parts would have by themselves. This allows them, defenders say, to combine (...) the attractions of purely subjective and purely objective views. This common understanding of the theories is, however, mistaken. At the most fundamental level they don't combine a subjective and an objective element but two objective ones. Once this is understood, their attraction as hybrid theories diminishes: the value in their wholes may be just the sum of the values in their parts. (shrink)

We introduce and study (weakly) semi-equational theories, generalizing equationality in stable theories (in the sense of Srour) to the NIP context. In particular, we establish a connection to distality via one-sided strong honest definitions; demonstrate that certain trees are semi-equational, while algebraically closed valued fields are not weakly semi-equational; and obtain a general criterion for weak semi-equationality of an expansion of a distal structure by a new predicate.

This article examines G. A. Cohen’s endorsement of a hybrid ethical theory and its relationship to his critique of John Rawls’s egalitarian liberalism. Cohen claimed that Rawls’s appeal to special incentives was a distortion of his own difference principle. I argue that Cohen’s acceptance of a personal prerogative (the central element of Samuel Scheffler’s version of a hybrid ethical theory) has several untoward consequences. First, it illuminates how any reasonable challenge to Rawls’s liberalism must recognise Thomas (...) Nagel’s arguments concerning the problems that arise when one attempts to implement a political theory analogous to a hybrid theory of ethics. Second, it undermines Cohen’s critique of Rawls. Third, it undermines the plausibility of Cohen’s ethos-driven social egalitarianism. The article concludes that, despite Nagel’s concerns, the most plausible form of egalitarianism—one that can accommodate the requirements of a hybrid ethical theory—will be Rawlsian, rather than Cohen’s ethos-based system. (shrink)

We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields and of the theory of separably closed fields of arbitrary imperfection degree.

Este artigo canta uma canção — uma canção criada ao unir o trabalho de quatro grandes nomes na história da lógica: Hans Reichenbach, Arthur Prior, Richard Montague, e Leon Henkin. Embora a obra dos primeiros três desses autores tenha sido previamente combinada, acrescentar as ideias de Leon Henkin é o acréscimo requerido para fazer com que essa combinação funcione no nível lógico. Mas o presente trabalho não se concentra nas tecnicalidades subjacentes (que podem ser encontradas em Areces, Blackburn, Huertas, e (...) Manzano [no prelo]), e sim nos instrumentos subjacentes e no modo como trabalham em conjunto. Esperamos que o leitor fique tentado a cantar junto. DOI:10.5007/1808-1711.2011v15n2p225. (shrink)

This paper provides characterisations of the equational theory of the PER model of a typed lambda calculus with inductive types. The characterisation may be cast as a full abstraction result; in other words, we show that the equations between terms valid in this model coincides with a certain syntactically defined equivalence relation. Along the way we give other characterisations of this equivalence; from below, from above, and from a domain model, a version of the Kreisel-Lacombe-Shoenfield theorem allows us (...) to transfer the result from the domain model to the PER model. (shrink)

This paper sings a song — a song created by bringing together the work of four great names in the history of logic: Hans Reichenbach, Arthur Prior, Richard Montague, and Leon Henkin. Although the work of the first three of these authors have previously been combined, adding the ideas of Leon Henkin is the addition required to make the combination work at the logical level. But the present paper does not focus on the underlying technicalities rather it focusses on the (...) underlying instruments, and the way they work together. We hope the reader will be tempted to sing a long. (shrink)

This paper presents a theory of reasoning with evidence in order to determine the facts in a criminal case. The focus is on the process of proof, in which the facts of the case are determined, rather than on related legal issues, such as the admissibility of evidence. In the literature, two approaches to reasoning with evidence can be distinguished, one argument-based and one story-based. In an argument-based approach to reasoning with evidence, the reasons for and against the occurrence (...) of an event, e.g., based on witness testimony, are central. In a story-based approach, evidence is evaluated and interpreted from the perspective of the factual stories as they may have occurred in a case, e.g., as they are defended by the prosecution. In this paper, we argue that both arguments and narratives are relevant and useful in the reasoning with and interpretation of evidence. Therefore, a hybrid approach is proposed and formally developed, doing justice to both the argument-based and the narrative-based perspective. By the formalization of the theory and the associated graphical representations, our proposal is the basis for the design of software developed as a tool to make sense of the evidence in complex cases. (shrink)

We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret $@_i$ in propositional and first-order hybrid logic. This means: interpret $@_i\alpha _a$ , where $\alpha _a$ is an expression of any type $a$ , as an expression of type $a$ (...) that rigidly returns the value that $\alpha_a$ receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and (as is usual inhybrid logic) we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

It is well known that the model categories of universal Horn theories are locally presentable, hence essentially algebraic . In the special case of quasivarieties a direct translation of the implicational syntax into the essentially equational one is known . Here we present a similar translation for the general case, showing at the same time that many relationally presented Horn classes are in fact quasivarieties.

For a finite von Neumann algebra factor M, the projections form a modular ortholattice L(M). We show that the equational theory of L(M) coincides with that of some resp. all L(ℂ n × n ) and is decidable. In contrast, the uniform word problem for the variety generated by all L(ℂ n × n ) is shown to be undecidable.

In this paper, I have two primary goals. First, I show that the causal-based story approach in A hybrid formal theory of arguments, stories and criminal evidence is ill suited to negative causation. In the literature, the causal-based approach requires that hypothetical stories be causally linked to the explanandum. Many take these links to denote physical or psychological causation, or temporal precedence. However, understanding causality in those terms, as I will show, cannot capture cases of negative causation, which (...) are of interest to the Law. In keeping with this, I also discuss some of the difficulties Hybrid Theory invites by remaining silent on the nature of the causal links. In my second aim, I sketch a way for Hybrid Theory to overcome this problem. By replacing the original, underlying causal structure with contrastive causation in the law, Hybrid Theory can represent reasoning in which the evidence that is appealed to is causally linked via negative causation to the explananda. (shrink)

Suppose that T is an equational theory of groups or of rings. If T is finitely axiomatizable, then there is a least number μ so that T can be axiomatized by μ equations. This μ can depend on the operation symbols that occur in T. In the 1960s, Tarski and Green completely determined the values of μ for arbitrary equational theories of groups and of rings. While Tarski and Green announced the results of their collaboration in 1970, (...) the only fuller publication of their work occurred as part of a seminar led by Tarski at Berkeley during the 1968–69 academic year. The present paper gives a full account of their findings and their proofs. (shrink)

Among others we will prove that the equational theory of ω dimensional representable polyadic equality algebras (RPEA ω 's) is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable (and hence the equational theory of this class is finite schema-axiomatizable, as well). We will also show that the complexity of the equational theory of RPEA ω is also (...) extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and Viktor Gyuris [12], the following methodological conclusions will be drawn: The negative properties of polyadic (equality) algebras can be removed by switching from what we call the "polyadic algebraic paradigm" to the "cylindric algebraic paradigm". (shrink)

We show that basic hybridization makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are to add nominals as expressions of type t, and to extend to arbitrary types the way we interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i$\end{document} in propositional and first-order hybrid logic. This means: interpret \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$@_i\alpha _a$\end{document}, where \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} (...) \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha _a$\end{document} is an expression of any type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document}, as an expression of type \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$a$\end{document} that rigidly returns the value that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\alpha_a$\end{document} receives at the i-world. The axiomatization and completeness proofs are generalizations of those found in propositional and first-order hybrid logic, and we automatically obtain a wide range of completeness results for stronger logics and languages. Our approach is deliberately low-tech. We don’t, for example, make use of Montague’s intensional type s, or Fitting-style intensional models; we build, as simply as we can, hybrid logicover Henkin’s logic. (shrink)

For $\Bbb {F}$ the field of real or complex numbers, let $CG(\Bbb {F})$ be the continuous geometry constructed by von Neumann as a limit of finite dimensional projective geometries over $\Bbb {F}$ . Our purpose here is to show the equational theory of $CG(\Bbb {F})$ is decidable.

The class \ of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of \ nor the first order theory of \ are decidable. Moreover, we show that the set of all equations valid in \ is exactly on the \ level. We consider the class \ of the relation algebra reducts (...) of \ ’s, as well. We prove that the equational theory of \ is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work. (shrink)

Several attempts have been done to distinguish “positive” information in an arbitrary first order theory, i.e., to find a well behaved class of closed sets among the definable sets. In many cases, a definable set is said to be closed if its conjugates are sufficiently distinct from each other. Each such definition yields a class of theories, namely those where all definable sets are constructible, i.e., boolean combinations of closed sets. Here are some examples, ordered by strength:Weak normality describes (...) a rather small class of theories which are well understood by now (see, for example, [P]). On the other hand, normalization is so weak that all theories, in a suitable context, are normalizable (see [HH]). Thus equational theories form an interesting intermediate class of theories. Little work has been done so far. The original work of Srour [S1, S2, S3] adopts a point of view that is closer to universal algebra than to stability theory. The fundamental definitions and model theoretic properties can be found in [PS], though some easy observations are missing there. Hrushovski's example of a stable non-equational theory, the first and only one so far, is described in the unfortunately unpublished manuscript [HS]. In fact, it is an expansion of the free pseudospace constructed independently by Baudisch and Pillay in [BP] as an example of a strictly 2-ample theory. Strong equationality, defined in [Hr], is also investigated in [HS]. (shrink)

We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symbols. We show that consistency of such equational theories can be proved in the weak fragment of arithmetic S 1 2 . In particular this solves an open problem formulated by TAKEUTI (c.f. [5, p.5 problem 9.]).

Alternative theories of relativistic rotation considered viable as of 2004 are compared in the light of experiments reported in 2005. En route, the contentious issue of simultaneity choice in rotation is resolved by showing that only one simultaneity choice, the one possessing continuous time, gives rise, via the general relativistic equation of motion, to the correct Newtonian limit Coriolis acceleration. In addition, the widely dispersed argument purporting Lorentz contraction in rotation and the concomitant curved surface of a rotating disk is (...) analyzed and argued to be lacking for more than one reason. It is posited that not by theoretical arguments, but only via experiment can we know whether such effect exists in rotation or not. The Coriolis/simultaneity correlation, and the results of the 2005 experiments, support the Selleri theory as being closest to the truth, though it is incomplete in a more general applicability sense, because it does not provide a global metric. Two alternatives, a modified Klauber approach and a Selleri–Klauber hybrid, are presented which are consistent with recent experiment and have a global metric, thereby making them applicable to rotation problems of all types. (shrink)

Among others we will prove that the equational theory of $\omega$ dimensional representable polyadic equality algebras is not schema axiomatizable. This result is in interesting contrast with the Daigneault-Monk representation theorem, which states that the class of representable polyadic algebras is finite schema-axiomatizable. We will also show that the complexity of the equational theory of RPEA$_\omega$ is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko (...) Sain and Viktor Gyuris [12], the following methodological conclusions will be drawn: The negative properties of polyadic algebras can be removed by switching from what we call the "polyadic algebraic paradigm" to the "cylindric algebraic paradigm". (shrink)

The class $$\mathsf{TPA}$$ TPA of t rue p airing a lgebras is defined to be the class of relation algebras expanded with concrete set theoretical projection functions. The main results of the present paper is that neither the equational theory of $$\mathsf{TPA}$$ TPA nor the first order theory of $$\mathsf{TPA}$$ TPA are decidable. Moreover, we show that the set of all equations valid in $$\mathsf{TPA}$$ TPA is exactly on the $$\Pi ^1_1$$ Π 1 1 level. We consider (...) the class $$\mathsf{TPA}^-$$ TPA - of the relation algebra reducts of $$\mathsf{TPA}$$ TPA ’s, as well. We prove that the equational theory of $$\mathsf{TPA}^-$$ TPA - is much simpler, namely, it is recursively enumerable. We also give motivation for our results and some connections to related work. (shrink)

Among others we will see that the equational theory of ω dimensional representable polyadic equality algebras. We will also see that the complexity of the equational theory of RPEAω is also extremely high in the recursion theoretic sense. Finally, comparing the present negative results with the positive results of Ildiko Sain and Viktor Gyuris [10], the following methodological conclusions will be drawn: the negative properties of polyadic algebras can be removed by switching from what we call (...) the `polyadic algebraic paradigm' to the `cylindric algebraic paradigm'. (shrink)

We show the undecidability of the equational theories of some classes of BAOs with a non-associative, residuated binary extra-Boolean operator. These results solve problems in Jipsen [9], Pratt [21] and Roorda [22], [23]. This paper complements Andréka-Kurucz-Németi-Sain-Simon [3] where the emphasis is on BAOs with an associative binary operator.

This work presents a systematic study of decision problems for equational theories of algebras of binary relations (relation algebras). For example, an easily applicable but deep method, based on von Neumann's coordinatization theorem, is developed for establishing undecidability results. The method is used to solve several outstanding problems posed by Tarski. In addition, the complexity of intervals of equational theories of relation algebras with respect to questions of decidability is investigated. Using ideas that go back to Jonsson and (...) Lyndon, the authors show that such intervals can have the same complexity as the lattice of subsets of the set of the natural numbers. Finally, some new and quite interesting examples of decidable equational theories are given. The methods developed in the monograph show promise of broad applicability. They provide researchers in algebra and logic with a new arsenal of techniques for resolving decision questions in various domains of algebraic logic. (shrink)

A common objection to consequentialism is that it makes unreasonable demands upon moral agents, by failing to allow agents to give special weight to their own personal projects and interests. A prominent recent response to this objection is that of Samuel Scheffler, who seeks to make room for moral agents by building agent-centred prerogatives into a consequentialist moral theory. In this paper, I present a new objection to Scheffler's account. I then sketch an improved prerogative, which avoids this objection (...) by incorporating a non-proportional account of the relationship between values, costs and reasons. (shrink)

This book provides a unique survey displaying the power of Riccati equations to describe reversible and irreversible processes in physics and, in particular, quantum physics. Quantum mechanics is supposedly linear, invariant under time-reversal, conserving energy and, in contrast to classical theories, essentially based on the use of complex quantities. However, on a macroscopic level, processes apparently obey nonlinear irreversible evolution equations and dissipate energy. The Riccati equation, a nonlinear equation that can be linearized, has the potential to link these two (...) worlds when applied to complex quantities. The nonlinearity can provide information about the phase-amplitude correlations of the complex quantities that cannot be obtained from the linearized form. As revealed in this wide ranging treatment, Riccati equations can also be found in many diverse fields of physics from Bose-Einstein-condensates to cosmology. The book will appeal to graduate students and theoretical physicists interested in a consistent mathematical description of physical laws. (shrink)

The handicap principle has come under significant challenge both from empirical studies and from theoretical work. As a result, a number of alternative explanations for honest signaling have been proposed. This paper compares the evolutionary plausibility of one such alternative, the "hybrid equilibrium," to the handicap principle. We utilize computer simulations to compare these two theories as they are instantiated in Maynard Smith's Sir Philip Sidney game. We conclude that, when both types of communication are possible, evolution is unlikely (...) to lead to handicap signaling and is far more likely to result in the partially honest signaling predicted by hybrid equilibrium theory. (shrink)

Over the past decade artists have increasingly turned to science in order to investigate technology’s effect. The move from hardware-based technologies to live organisms as media, raises ethical issues that the broader art community is addressing. This paper tracks the history of instrumental disengagement to determine when and how the gradual codification of life contributed to the eventual use of live organisms in art practice.

The Church-Turing Thesis (CTT) is often paraphrased as ``every computable function is computable by means of a Turing machine.'' The author has constructed a family of equational theories that are not Turing-decidable, that is, given one of the theories, no Turing machine can recognize whether an arbitrary equation is in the theory or not. But the theory is called pseudorecursive because it has the additional property that when attention is limited to equations with a bounded number of (...) variables, one obtains, for each number of variables, a fragment of the theory that is indeed Turing-decidable. In a 1982 conversation, Alfred Tarski announced that he believed the theory to be decidable, despite this contradicting CTT. The article gives the background for this proclamation, considers alternate interpretations, and sets the stage for further research. (shrink)

Theories are processes modelled by thought. When they evolve in time, they are transformed and become new theories. They may cross from one academic discipline to another, then open up to new areas of human knowledge, mixing together the humanities, art, science and even spirituality. The way they are modelled reveals their plasticity and their elasticity is tested in their potential for transfer from one field to another, while the different contacts they make and mergers they undergo generate a certain (...) hybridity. Plasticity, elasticity and hybridity are the triad which makes the transfer of theories possible. (shrink)

Theories are processes modelled by thought. When they evolve in time, they are transformed and become new theories. They may cross from one academic discipline to another, then open up to new areas of human knowledge, mixing together the humanities, art, science and even spirituality. The way they are modelled reveals their plasticity and their elasticity is tested in their potential for transfer from one domain to another, while the different contacts they make and mergers they undergo generate a certain (...) hybridity. Plasticity, elasticity and hybridity are the triad which make the transfer of theories possible. (shrink)

What if the Big Bang was an exodus of non-existing reality into existence? In this book a theory of the reality is started from the principle that 'existing takes time' but in states of the universe there are pre-things in moments, thus non-existing, which realize in strings over specific time intervals as existing phenomena. Causality must be reviewed now and new paradigms for reality follow. The existing and observed universe are discontinuous and "limits" in mathematical models do not correspond (...) to reality. New interpretations in evolution theory and the human condition are being investigated. (shrink)

This chapter surveys hybrid theories of well-being. It also discusses some criticisms, and suggests some new directions that philosophical discussion of hybrid theories might take.

Time passes; sometimes swiftly, sometimes interminably, but always it passes. We see the world change as events emerge from the shroud of the future, clandestinely slinking into the past almost immediately as though they are reluctant to meet our gaze: children are born, old friends and relatives die, governments once full of youthful enthusiasm wane. If the Earth were sentient, it might feel itself being torn apart as tectonic plates diverge, and chuckle as it outlived species upon species of transient (...) parasites. How could anyone possibly deny that time passes? (shrink)