The inverse of the distance between two structures $\mathscr{A} \not\equiv \mathscr{B}$ of finite type $\tau$ is naturally measured by the smallest integer $q$ such that a sentence of quantifier rank $q - 1$ is satisfied by $\mathscr{A}$ but not by $\mathscr{B}$. In this way the space $\operatorname{Str}^\tau$ of structures of type $\tau$ is equipped with a pseudometric. The induced topology coincides with the elementary topology of $\operatorname{Str}^\tau$. Using the rudiments of the theory of uniform spaces, in this elementary note we (...) prove the convergence of every Cauchy net of structures, for any type $\tau$. (shrink)

The inverse of the distance between two structures $\mathscr{A} \not\equiv \mathscr{B}$ of finite type τ is naturally measured by the smallest integer q such that a sentence of quantifier rank q - 1 is satisfied by A but not by B. In this way the space $\operatorname{Str}^\tau$ of structures of type τ is equipped with a pseudometric. The induced topology coincides with the elementary topology of $\operatorname{Str}^\tau$ . Using the rudiments of the theory of uniform spaces, in this elementary note (...) we prove the convergence of every Cauchy net of structures, for any type τ. (shrink)

Ultrafilters play a significant role in model theory to characterize logics having various compactness and interpolation properties. They also provide a general method to construct extensions of first-order logic having these properties. A main result of this paper is that every class $\Omega $ of uniform ultrafilters generates a $\Delta $ -closed logic ${\mathcal {L}}_\Omega $. ${\mathcal {L}}_\Omega $ is $\omega $ -relatively compact iff some $D\in \Omega $ fails to be $\omega _1$ -complete iff ${\mathcal {L}}_\Omega $ does not (...) contain the quantifier “there are uncountably many.” If $\Omega $ is a set, or if it contains a countably incomplete ultrafilter, then ${\mathcal {L}}_\Omega $ is not generated by Mostowski cardinality quantifiers. Assuming $\neg 0^\sharp $ or $\neg L^{\mu }$, if $D\in \Omega $ is a uniform ultrafilter over a regular cardinal $\nu $, then every family $\Psi $ of formulas in ${\mathcal {L}}_\Omega $ with $|\Phi |\leq \nu $ satisfies the compactness theorem. In particular, if $\Omega $ is a proper class of uniform ultrafilters over regular cardinals, ${\mathcal {L}}_\Omega $ is compact. (shrink)

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L 3, the intuitionistic system I 1 and several paraconsistent logics, as for instance Sette's system P 1, the D'Ottaviano and da Costa system J 3 and da Costa's systems C n, 1 n. (shrink)

De Finetti gave a natural definition of “coherent probability assessment” β:E→[0,1] of a set E={X1,…,Xm} of “events” occurring in an arbitrary set of “possible worlds”. In the particular case of yes–no events, , Kolmogorov axioms can be derived from his criterion. While De Finetti’s approach to probability was logic-free, we construct a theory Θ in infinite-valued Łukasiewicz propositional logic, and show: a possible world of is a valuation satisfying Θ, β is coherent iff it is a convex combination of valuations (...) satisfying Θ, iff β agrees on E with a state of the Lindenbaum MV-algebra of Θ, iff for some Borel probability measure μ on . Thus Łukasiewicz semantics, MV-algebraic states, and Borel probability measures provide a universal representation of coherent assessments of events occurring in any conceivable set of possible worlds. (shrink)

If S ⊆{0,1}; * and S ′ = {0,1} * \sb S are both recognized within a certain nondeterministic time bound T then, in not much more time, one can write down tautologies A n → A′ n with unique interpolants I n that define S ∩{0,1} n ; hence, if one can rapidly find unique interpolants, then one can recognize S within deterministic time T p for some fixed p \s>0. In general, complexity measures for the problem of finding (...) unique interpolants in sentential logic yield new relations between circuit depth and nondeterministic Turing time, as well as between proof length and the complexity of decision procedures of logical theories. (shrink)

Let $\to $ be a continuous $\protect \operatorname {\mathrm {[0,1]}}$ -valued function defined on the unit square $\protect \operatorname {\mathrm {[0,1]}}^2$, having the following properties: $x\to = y\to $ and $x\to y=1 $ iff $x\leq y$. Let $\neg x=x\to 0$. Then the algebra $W=$ satisfies the time-honored Łukasiewicz axioms of his infinite-valued calculus. Let $x\to _{\text {\tiny \L }}y=\min $ and $\neg _{\text {\tiny \L }}x=x\to _{\text {\tiny \L }} 0 =1-x.$ Then there is precisely one isomorphism $\phi $ of (...) W onto the standard Wajsberg algebra $W_{\text {\tiny \L }}= $. Thus $x\to y= \phi ^{-1}+\phi ))$. (shrink)

Chang's MV algebras are the algebras of the infinite-valued sentential calculus of ukasiewicz. We introduce finitely additive measures (called states) on MV algebras with the intent of capturing the notion of average degree of truth of a proposition. Since Boolean algebras coincide with idempotent MV algebras, states yield a generalization of finitely additive measures. Since MV algebras stand to Boolean algebras as AFC*-algebras stand to commutative AFC*-algebras, states are naturally related to noncommutativeC*-algebraic measures.

Machines were introduced as calculating devices to simulate operations carried out by human computers following fixed algorithms. The mathematical study of (paper) machines is the topic of our essay. The first three sections provide necessary logical background, examine the analyses of effective calculability given in the thirties, and describe results that are central to recursion theory, reinforcing the conceptual analyses. In the final section we pursue our investigation in a quite different way and focus on principles that govern the operations (...) of physically realizable machines. (shrink)

A substantial guide providing an overview of both physicalism and metaphysical naturalism, reviewing both questions of formulation and justification for both doctrines. Includes a diagnostic strategy for understanding talk of naturalism as a metaphysical thesis.

We give a constructive proof of McNaughton's theorem stating that every piecewise linear function with integral coefficients is representable by some sentence in the infinite-valued calculus of Lukasiewicz. For the proof we only use Minkowski's convex body theorem and the rudiments of piecewise linear topology.

Given an abstract logic L = L(Q i ) i ∈ I generated by a set of quantifiers Q i , one can construct for each type τ a topological space S τ exactly as one constructs the Stone space for τ in first-order logic. Letting T be an arbitrary directed set of types, the set $S_T = \{(S_\tau, \pi^\tau_\sigma)\mid\sigma, \tau \in T, \sigma \subset \tau\}$ is an inverse topological system whose bonding mappings π τ σ are naturally determined by (...) the reduct operation on structures. We relate the compactness of L to the topological properties of S T . For example, if I is countable then L is compact iff for every τ each clopen subset of S τ is of finite type and S τ is homeomorphic to $\underset{lim}S_T$ , where T is the set of finite subtypes of τ. We finally apply our results to concrete logics. (shrink)

Boolean logic deals with {0, 1}-observables and yes–no events, as many-valued logic does for continuous ones. Since every measurement has an error, continuity ensures that small measurement errors on elementary observables have small effects on compound observables. Continuity is irrelevant for {0, 1}-observables. Functional completeness no longer holds when n-ary connectives are understood as [0, 1]-valued maps defined on [0, 1] n . So one must envisage suitable selection criteria for [0, 1]-connectives. Łukasiewicz implication has a well known characterization as (...) the only continuous connective \ satisfying the following conditions: \= y\Rightarrow}\) and \ . Then syntactic consequence can be defined purely algorithmically using the Łukasiewicz axioms and Modus Ponens. As discussed in this paper, to recover a strongly complete semantics one may use differential valuations. (shrink)

We establish the Robinson joint consistency theorem for the infinite-valued propositional logic of Łukasiewicz. As a corollary we easily obtain the amalgamation property for MV-algebras—the algebras of Łukasiewicz logic: all pre-existing proofs of this latter result make essential use of the Pierce amalgamation theorem for abelian lattice-ordered groups together with the categorical equivalence Γ between these groups and MV-algebras. Our main tools are elementary and geometric.

We perceive smells as perduring complex entities within a distal array that might be conceived of as smellscapes. However, the philosophical orthodoxy of Odor Theories has been to deny that smells are perceived as having a distal location. Recent challenges have been mounted to Odor Theories’ veracity in handling the timescale of olfactory perception, how it individuates odors as a distal entities, and their claim that olfactory perception is not spatial. The paper does not aim to dispute these criticisms. Rather, (...) what will be shown is that Molecular Structure Theory, a refinement of Odor Theory, can be further developed to handle these challenges. The theory is further refined by focusing on distal perception that requires considering the perceptual object as mereologically complex persisting odor against a background scene conceived of as a smellscape. What will be offered is an expansion of Molecular Structure Theory to account for distal smell perception within natural environments. (shrink)

We prove that de Finetti coherence is preserved under taking products of coherent books on two sets of independent events. This establishes a desirable closure property of coherence: were it not the case it would raise a question mark over the utility of de Finetti’s notion of coherence.

Inside What Would Plato Do?, you'll find the basics of philosophy, written in an easy, digestible way we can all understand, along with questions to help you apply these important theories to your own life. So, after you've learned about a philosophical concept, you'll then be challenged to test yourself and see how the results can impact your daily life. For instance, after learning about Kant's theory of morality and the importance of intention you're challenged with questions like: Can good (...) people do bad things? Was there a time when you intended to do something helpful that ended up being hurtful? Does that make you a good person (because you intended to do good) or a bad person (because the results were bad)? What Would Plato Do? will not only help you better understand some of the greatest thinkers ever but will also help you think of the world around you in a whole new way! (shrink)

Building on Wójcicki’s work on infinite-valued Łukasiewicz logic Ł ∞ , we give a self-contained proof of the deductive interpolation theorem for Ł ∞ . This paper aims at introducing the reader to the geometry of Łukasiewicz logic.

In classical propositional logic, a theory T is prime iff it is complete. In Łukasiewicz infinite-valued logic the two notions split, completeness being stronger than primeness. Using toric desingularization algorithms and the fine structure of prime ideal spaces of free ℓ -groups, in this paper we shall characterize prime theories in infinite-valued logic. We will show that recursively enumerable prime theories over a finite number of variables are decidable, and we will exhibit an example of an undecidable r.e. prime theory (...) over countably many variables. (shrink)

Daniele Mundici and Wilfred Sieg. Computability Theory.

An MV-algebra A=(A,0,¬,⊕) is an abelian monoid (A,0,⊕) equipped with a unary operation ¬ such that ¬¬x=x,x⊕¬0=¬0, and y⊕¬(y⊕¬x)=x⊕¬(x⊕¬y). Chang proved that the equational class of MV-algebras is generated by the real unit interval [0,1] equipped with the operations ¬x=1−x and x⊕y=min(1,x+y). Therefore, the free n-generated MV-algebra Free n is the algebra of [0,1]-valued functions over the n-cube [0,1] n generated by the coordinate functions ξ i ,i=1, . . . ,n, with pointwise operations. Any such function f is a (...) McNaughton function, i.e., f is continuous, piecewise linear, and each piece has integer coefficients. Conversely, McNaughton proved that all McNaughton functions f: [0,1] n →[0,1] are in Free n . The elements of Free n are logical equivalence classes of n-variable formulas in the infinite-valued calculus of Łukasiewicz. The aim of this paper is to provide an alternative, representation-free, characterization of Free n. (shrink)

We are immersed within an odorous sea of chemical currents that we parse into individual odors with complex structures. Odors have been posited as determined by the structural relation between the molecules that compose the chemical compounds and their interactions with the receptor site. But, naturally occurring smells are parsed from gaseous odor plumes. To give a comprehensive account of the nature of odors the chemosciences must account for these large distributed entities as well. We offer a focused review of (...) what is known about the perception of odor plumes for olfactory navigation and tracking, which we then connect to what is known about the role odorants play as properties of the plume in determining odor identity with respect to odor quality. We end by motivating our central claim that more research needs to be conducted on the role that odorants play within the odor plume in determining odor identity. (shrink)

We prove the following algebraic characterization of elementary equivalence: $\equiv$ restricted to countable structures of finite type is minimal among the equivalence relations, other than isomorphism, which are preserved under reduct and renaming and which have the Robinson property; the latter is a faithful adaptation for equivalence relations of the familiar model theoretical notion. We apply this result to Friedman's fourth problem by proving that if L = L ωω (Q i ) i ∈ ω 1 is an (ω 1 (...) , ω)-compact logic satisfying both the Robinson consistency theorem on countable structures of finite type and the Löwenheim-Skolem theorem for some $\lambda for theories having ω 1 many sentences, then $\equiv_L = \equiv$ on such structures. (shrink)

Reflection Principles are commonly thought to produce only strong axioms of infinity consistent with V = L. It would be desirable to have some notion of strong reflection to remedy this, and we have proposed Global Reflection Principles based on a somewhat Cantorian view of the universe. Such principles justify the kind of cardinals needed for, inter alia , Woodin’s Ω-Logic.

When it originated in the late 19th century, psychometrics was a field with both a scientific and a social mission: psychometrics provided new methods for research into individual differences, and at the same time, these psychometric instruments were considered a means to create a new social order. In contrast, contemporary psychometrics - due to its highly technical nature and its limited involvement in substantive psychological research - has created the impression of being a value-free discipline. In this article, we develop (...) a contrasting characterization of contemporary psychometrics as a value-laden discipline. We expose four such values: that individual differences are quantitative (rather than qualitative), that measurement should be objective in a specific sense, that test items should be fair, and that utility of a model is more important than its truth. Our goal is not to criticize psychometrics for employing these values, but rather to bring them into the open and to show that these values are not inevitable and are in need of systematic evaluation. (shrink)

There is a natural map which assigns to every modelU of typeτ, (U ε Stτ) a groupG (U) in such a way that elementarily equivalent models are mapped into isomorphic groups.G(U) is a subset of a collection whose members are called Fraisse arrows (they are decreasing sequences of sets of partial isomorphisms) and which arise in connection with the Fraisse characterization of elementary equivalence. LetEC λ U be defined as {U εStr τ: ℬ ≡U and |ℬ|=λ; thenEG λ U can (...) be faithfully (i.e. 1-1) represented onto G(U) ×π *, whereπ *, is a collection of partitions over λ∪λ2∪.. (shrink)