The languages of finitary and infinitary logic over the alphabet of bounded lattices have proven to be of considerable use in the study of compacta. Significant among the sentences of these languages are the ones that are base free, those whose truth is unchanged when we move among the lattice bases of a compactum. In this paper we define syntactically the expansive sentences, and show each of them to be base free. We also show that many (...) well-known properties of compacta may be expressed using expansive sentences; and that any property so expressible is closed under inverse limits and co-existential images. As a byproduct, we conclude that co-existential images of pseudo-arcs are pseudo-arcs. This is of interest because the corresponding statement for confluent maps is still open, and co-existential maps are often—but not always—confluent. (shrink)

Technology used in online marketing has advanced to a state where collection, enhancement and aggregation of information are instantaneous. This proliferation of customer information focused technology brings with it a host of issues surrounding customer privacy. This article makes two key contributions to the debate concerning digital privacy. First, we use theories of justice to help understand the way consumers conceive of, and react to, privacy concerns. Specifically, it is argued that an important component of consumers' privacy concerns relates to (...) fairness judgments, which in turn comprise of the two primary components of distributive and procedural justice. Second, we make a number of prescriptions, aimed at both firms and regulators, based on the notion that consumers respond to perceived privacy violations in much the same way they would respond to an unfair exchange. (shrink)

The fungal cell wall is a dynamic structure that protects the cell from changes in osmotic pressure and other environmental stresses, while allowing the fungal cell to interact with its environment. The structure and biosynthesis of a fungal cell wall is unique to the fungi, and is therefore an excellent target for the development of anti‐fungal drugs. The structure of the fungal cell wall and the drugs that target its biosynthesis are reviewed. Based on studies in a number of fungi, (...) the cell wall has been shown to be primarily composed of chitin, glucans, mannans and glycoproteins. The biosynthesis of the various components of the fungal cell wall and the importance of the components in the formation of a functional cell wall, as revealed through mutational analyses, are discussed. There is strong evidence that the chitin, glucans and glycoproteins are covalently cross‐linked together and that the cross‐linking is a dynamic process that occurs extracellularly. BioEssays 28: 799–808, 2006. © 2006 Wiley Periodicals, Inc. (shrink)

Technology used in online marketing has advanced to a state where collection, enhancement and aggregation of information are instantaneous. This proliferation of customer information focused technology brings with it a host of issues surrounding customer privacy. This article makes two key contributions to the debate concerning digital privacy. First, we use theories of justice to help understand the way consumers conceive of, and react to, privacy concerns. Specifically, it is argued that an important component of consumers’ privacy concerns relates to (...) fairness judgments, which in turn comprise of the two primary components of distributive and procedural justice. Second, we make a number of prescriptions, aimed at both firms and regulators, based on the notion that consumers respond to perceived privacy violations in much the same way they would respond to an unfair exchange. (shrink)

Dynamic epistemic logic (DEL) is a multi-modal logic for reasoning about the change of knowledge in multi-agent systems. It extends epistemic logic by a modal operator for actions which announce logical formulas to other agents. In Hilbert-style proof calculi for DEL, modal action formulas are reduced to epistemic logic, whereas current sequent calculi for DEL are labelled systems which internalize the semantic accessibility relation of the modal operators, as well as the accessibility relation underlying the semantics of the (...) actions. We present a novel cut-free ordinary sequent calculus, called |$ \textbf{G4}_{P,A}[] $|⁠, for propositional DEL. In contrast to the known sequent calculi, our calculus does not internalize the accessibility relations, but—similar to Hilbert style proof calculi—action formulas are reduced to epistemic formulas. Since no ordinary sequent calculus for full S5 modal logic is known, the proof rules for the knowledge operator and the Boolean operators are those of an underlying S4 modal calculus. We show the soundness and completeness of |$ \textbf{G4}_{P,A}[] $| and prove also the admissibility of the cut-rule and of several other rules for introducing the action modality. (shrink)

In abstract algebraic logic, many systems, such as those paraconsistent logics taking inspiration from da Costa's hierarchy, are not algebraizable by even the broadest standard methodologies, as that of Blok and Pigozzi. However, these logics can be semantically characterized by means of non-deterministic algebraic structures such as Nmatrices, RNmatrices and swap structures. These structures are based on multialgebras, which generalize algebras by allowing the result of an operation to assume a non-empty set of values. This leads to an interest in (...) exploring the foundations of multialgebras applied to the study of logic systems. -/- It is well known from universal algebra that, for every signature Sigma, there exist algebras over Sigma which are absolutely free, meaning that they do not satisfy any identities or, alternatively, satisfy the universal mapping property for the class of Sigma-algebras. Furthermore, once we fix a cardinality of the generating set, they are, up to isomorphisms, unique, and equal to algebras of terms (or propositional formulas, in the context of logic). Equivalently, the forgetful functor, from the category of Sigma-algebras to Set, has a left adjoint. This result does not extend to multialgebras. Not only multialgebras satisfying the universal mapping property do not exist, but the forgetful functor U, from the category of Sigma-multialgebras to Set, does not have a left adjoint. -/- In this paper we generalize, in a natural way, algebras of terms to multialgebras of terms, whose family of submultialgebras enjoys many properties of the former. One example is that, to every pair consisting of a function, from a submultialgebra of a multialgebra of terms to another multialgebra, and a collection of choices (which selects how a homomorphism approaches indeterminacies), there corresponds a unique homomorphism, what resembles the universal mapping property. Another example is that the multialgebras of terms are generated by a set that may be viewed as a strong basis, which we call the ground of the multialgebra. Submultialgebras of multialgebras of terms are what we call weakly free multialgebras. Finally, with these definitions at hand, we offer a simple proof that multialgebras with the universal mapping property for the class of all multialgebras do not exist and that U does not have a left adjoint. (shrink)

Free logics are a family of first-order logics which came about as a result of examining the existence assumptions of classical logic (Hintikka _The Journal of Philosophy_, _56_, 125–137 1959 ; Lambert _Notre Dame Journal of Formal Logic_, _8_, 133–144 1967, 1997, 2001 ). What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. (...) Free logics reject the claim that names need to denote in (ii). _Positive_ free logic concedes that some atomic formulas containing non-denoting names (including self-identity) are true, _negative_ free logic treats them as uniformly false, and _neutral_ free logic as taking a third value. There has been a renewed interest in analyzing proof theory of free logic in recent years, based on intuitionistic logic in Maffezioli and Orlandelli (_Bulletin of the Section of Logic_, _48_(2), 137–158 2019 ) as well as classical logic in Pavlović and Gratzl (_Journal of Philosophical Logic_, _50_, 117–148 2021 ), there for the positive and negative variants. While the latter streamlines the presentation of free logics and offers a more unified approach to the variants under consideration, it does not cover neutral free logic, since there is some lack of both clear formal intuitions on the semantic status of formulas with empty names, as well as a satisfying account of the conditional in this context. We discuss extending the results to this third major variant of free logics. We present a series of G3 sequent calculi adapted from Fjellstad (_Studia Logica_, _105_(1), 93–119 2017, _Journal of Applied Non-Classical Logics_, _30_(3), 272–289 2020 ), which possess all the desired structural properties of a good proof system, including admissibility of contraction and all versions of the cut rule. At the same time, we maintain the unified approach to free logics and moreover argue that greater clarity of intuitions is achieved once neutral free logic is conceptualized as consisting of two sub-varieties. (shrink)

Early versions of satellite and radiosonde datasets suggested that the tropical surface had warmed more than the troposphere, while climate models consistently showed tropospheric amplification of surface warming in response to human-caused increases in greenhouse gases. We revisit such comparisons here using new observational estimates of surface and tropospheric temperature changes. We find that there is no longer a serious discrepancy between modeled and observed trends in the tropics. Our results contradict a recent claim that all simulated temperature trends in (...) the tropical troposphere are inconsistent with observations. This claim was based on the use of older radiosonde and satellite datasets and on two methodological errors: the neglect of observational trend uncertainties introduced by interannual climate variability and application of an inappropriate statistical “consistency test”.This emerging reconciliation of models and observations has two primary explanations. First, because of changes in the treatment of buoy and satellite information, new surface temperature datasets yield slightly reduced tropical warming relative to earlier versions. Second, recently developed satellite and radiosonde datasets now show larger warming of the tropical lower troposphere. In the case of a new satellite dataset from remote sensing systems, enhancedRSS warming is due to an improved procedure of adjusting for inter-satellite biases. When the RSS-derived tropospheric temperature trend is compared with four different observed estimates of surface temperature change, the surface warming is invariably amplified in the tropical troposphere, consistent with model results. Even if we use data from a second satellite dataset with smaller tropospheric warming than in remote sensing systems RSS, observed tropical lapse rates are not significantly different from those in all model simulations.Our results contradict a recent claim that all simulated temperature trends in the tropical troposphere and in tropical lapse rates are inconsistent with observations. This claim was based on the use of older radiosonde and satellite datasets and on two methodological errors: the neglect of observational trend uncertainties introduced by interannual climate variability and application of an inappropriate statistical “consistency test”. (shrink)

Using state-of-the-art observational datasets and results from a large archive of computer model simulations, a consortium of scientists from 12 different institutions has resolved a long-standing conundrum in climate science—the apparent discrepancy between simulated and observed temperature trends in the tropics. Research published by this group indicates that there is no fundamental discrepancy between modeled and observed tropical temperature trends when one accounts for: the uncertainties in observations; and the statistical uncertainties in estimating trends from observations. These results refute a (...) recent claim that model and observed tropical temperature trends “disagree to a statistically significant extent”. This claim was based on the application of a flawed statistical test and the use of older observational datasets. (shrink)

We describe a decidable class of formulas in a first order timed logic that covers a good amount of properties of real-time distributed systems. Earlier we described a decidable class based on some finiteness properties, and sketched a decidable class in a weaker logic that captures periodicity properties, though without complete proof. The new feature of the decidable class presented here is to be able to treat parametric properties, in particular, properties that concern an arbitrary number of processes as (...) compared to the just mentioned class that could express only properties for a fixed, explicitly given number of processes. As before the properties may use non-trivial arithmetics. We also state another important feature of the class: if a verification formula is not true then our algorithm gives a quantifier-free description of all its counter-models of the complexity involved in the definition of the decidable class and that is quite representative. In conclusion we discuss theoretical and practical issues of the complexity and some open questions. (shrink)

We study conditions for structures based on Banach spaces having the property that each set definable by neocompact formula is equivalent to the countable intersection of sets definable by quantifier-free formulas. We show that this property is invariant with respect to different nonstandard hull constructions and it is the same as Henson's Quantifier Elimination in sufficiently saturated nonstandard hulls of internal Banach spaces.

This paper introduces deontic logic based on inquisitive semantics. A semantics for action formulas is introduced where each action formula is associated with a set of alternatives. Deontic operators are then interpreted as quantifying over all alternatives associated with the action formulas within their scope. It is shown how this construction provides solutions to problems related to free choice permissions and obligations, including issues concerning Hurford disjunctions. The main technical result is a complete axiomatization of the logic.

Based on the computation mode introduced in [13], we deal with the time complexity of computations over arbitrary first-order structures.The main emphasis is on parameter-free computations. Some transfer results for solutions of P versus NP problems as well as relationships to quantifier elimination are discussed. By computation tree analysis using first-order formulas, it follows that P versus NP solutions and other results of structural complexity theory are invariant under elementary equivalence of structures.

Non-deterministic matrices are multiple-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. We consider two different types of semantics which are based on Nmatrices: the dynamic one and the static one . We use the Rasiowa-Sikorski decomposition methodology to get sound and complete proof systems employing finite sets of mv-signed formulas for all propositional logics based on such structures with either of the (...) above types of semantics. Later we demonstrate how these systems can be converted into cut-free ordinary Gentzen calculi which are also sound and complete for the corresponding non-deterministic semantics. As a by-product, we get new semantic characterizations for some well-known logics. (shrink)

Towards the end of her famous 1971 paper “Causality and Determination”, Elizabeth Anscombe discusses the controversial idea that “ ‘physical haphazard’ could be the only physical correlate of human freedom of action”. In order to illustrate how the high-level freedom of human action can go together with micro-indeterminism without creating a problem for micro-statistics, she provides the analogy of a glass box filled with minute coloured particles whose micro-dynamics is subject to statistical laws, while its outside reliably displays a recognisable (...) variation of a certain image created by an external cause. Anscombe’s example is somewhat enigmatic, and she provides no details to support its viability. In this paper we discuss the context of Anscombe’s analogy, and we provide basics of the theory and practice of building an Anscombe box. (shrink)

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal (...) ${\mathcal{Q}}$ Q -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties. (shrink)

In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas and use this criterion to obtain a simple proof that every locally tabular intermediate (...) logic is axiomatizable by Jankov-de Jongh formulas. We also show that not every intermediate logic is axiomatizable by frame based formulas. (shrink)

In contemporary free will theory, a significant number of philosophers are once again taking seriously the possibility that human beings do not have free will, and are therefore not morally responsible for their actions. (Free will is understood here as whatever satisfies the control condition of moral responsibility.) Free will theorists commonly assume that giving up the belief that human beings are morally responsible implies giving up all our beliefs about desert. But the consequences of giving (...) up the belief that we are morally responsible are not quite this dramatic. Giving up the belief that we are morally responsible undermines many, and perhaps most, of the desert claims we are pretheoretically inclined to accept. But it does not undermine desert claims based on the sheer fact of personhood. Even in the absence of belief in moral responsibility, personhood-based desert claims require us to respect persons and their rights. So personhood-based desert claims can provide a substantial role for desert in free will skeptics' ethical theories. (shrink)

In contemporary free will theory, a significant number of philosophers are once again taking seriously the possibility that human beings do not have free will, and are therefore not morally responsible for their actions. Free will theorists commonly assume that giving up the belief that human beings are morally responsible implies giving up all our beliefs about desert. But the consequences of giving up the belief that we are morally responsible are not quite this dramatic. Giving up (...) the belief that we are morally responsible undermines many, and perhaps most, of the desert claims we are pretheoretically inclined to accept. But it does not undermine desert claims based on the sheer fact of personhood. Even in the absence of belief in moral responsibility, personhood-based desert claims require us to respect persons and their rights. So personhood-based desert claims can provide a substantial role for desert in free will skeptics' ethical theories. (shrink)

A classical quantified modal logic is used to define a "feasible" arithmetic A 1 2 whose provably total functions are exactly the polynomial-time computable functions. Informally, one understands $\Box\alpha$ as "α is feasibly demonstrable". A 1 2 differs from a system A 2 that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e., $\Box$ -free) formulas. Thus, A 1 2 is defined without any reference to bounding terms, and admitting induction over (...) class='Hi'>formulas having arbitrarily many alternations of unbounded quantifiers. The system also uses only a very small set of initial functions. To obtain the characterization, one extends the Curry-Howard isomorphism to include modal operations. This leads to a realizability translation based on recent results in higher-type ramified recursion. The fact that induction formulas are not restricted in their logical complexity, allows one to use the Friedman A translation directly. The development also leads us to propose a new Frege rule, the "Modal Extension" rule: if $\vdash \alpha$ then $\vdash A \leftrightarrow \alpha$ a for new symbol A. (shrink)

This paper contributes to the principled construction of tableau-based decision procedures for hybrid logic with global, difference, and converse modalities. We also consider reflexive and transitive relations. For converse-free formulas we present a terminating control that does not rely on the usual chain-based blocking scheme. Our tableau systems are based on a new model existence theorem.

Each Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat (...) way of handling duality. (shrink)

Restorative Free Will examines free will as an adaptive capacity that evolved in humans and many other species, and restores free will to species excluded by claims of human uniqueness. Restorative Free Will recognizes the basic biological value of both libertarian and compatibilist elements of free will, and explains how these traditionally opposed accounts of free will capture an essential element of foraging animals' free will.

Each Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat (...) way of handling duality. (shrink)

Each Girard quantale provides a support for a semantics for linear propositional formulas. Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group. In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat way of handling duality.

This paper studies the problems of tip position regulation and vibration suppression of flexible manipulators without using the model. Because of the two-timescale characteristics of flexible manipulators, applying the existing model-free control methods may lead to ill-conditioned numerical problems. In this paper, the dynamics of a flexible manipulator is decomposed into two subsystems which are linear and controllable at different timescales by singular perturbation theory and a model-free composite controller is designed to alleviate the ill-conditioned numerical problems. To (...) do this, a model-free composite control strategy is constructed which facilitates in designing the controller in slow and fast timescales. In the slow timescale, the slow subsystem controller is designed by adaptive dynamic programming based on the measurements of the slow inputs and the position, while the vibration in the slow timescale is estimated by the least square method. In the fast timescale, the vibration is reconstructed based on the measurements of vibration and its estimate in the slow timescale, by which the fast controller is designed using ADP. Stability of the closed-loop system is proved by SP theory. Finally, simulations are given to show the feasibility and effectiveness of the proposed methods. (shrink)

Collision-free autonomous path planning under a dynamic and uncertainty vineyard environment is the most important issue which needs to be resolved firstly in the process of improving robotic harvesting manipulator intelligence. We present and apply energy optimal and artificial potential field to develop a path planning method for six degree of freedom serial harvesting robot under dynamic uncertain environment. Firstly, the kinematical model of Six-DOF serial manipulator was constructed by using the Denavit-Hartenberg method. The model of obstacles was defined (...) by axis-aligned bounding box, and then the configuration space of harvesting robot was described by combining the obstacles and arm space of robot. Secondly, the harvesting sequence in path planning was computed by energy optimal method, and the anticollision path points were automatically generated based on the artificial potential field and sampling searching method. Finally, to verify and test the proposed path planning algorithm, a virtual test system based on virtual reality was developed. After obtaining the space coordinates of grape picking point and anticollision bounding volume, the path points were drew out by the proposed method. 10 times picking tests for grape anticollision path planning were implemented on the developed simulation system, and the success rate was up to 90%. The results showed that the proposed path planning method can be used to the harvesting robot. (shrink)

This article describes the potential impact that free (i.e., open source) software can have on an existing commercial software market. A model for the software market is constructed in terms of autonomous agents, which represent the users, the companies, and the free software providers. The model specifies a reservation price for each user agent and develops a gradient learning strategy for revenue-maximizing company agents. Simulations explore parameters such as the demand distribution, and the relative importance of market share, (...) advertising and random effects in product visibility. Results from the case without free software show a prevalence of monopolies, which is consistent with other studies of high-technology market economics. The effects of free software are not uniform, but are highly parameter dependent. A “capture region” is found in which free software eventually dominates the market. (shrink)

The coordinate-free methods of the preceding paper are illustrated in three problems. First, the electrodynamics of a homogeneous, isotropic, and gyrotropic medium is investigated; it is shown that such a medium can exhibit optical activity, and the propagation of a plane electromagnetic wave in such a medium is discussed. Then, the electrodynamics of a homogeneous system made anisotropic by a uniform external magnetic field is considered; a description of Faraday rotation is provided, the ionosphere being used in an example. (...) Finally, the reflection and refraction of a plane electromagnetic wave at the interface of two media are described by coordinate-free operators. (shrink)

In many systems, the tensors used to describe physical properties must acquire their structure from one vector. Knowledge of that fact alone leads to an interesting line of analysis for such systems. The analysis begins with a discussion of the types of dyadics that can be constructed from one vector. Attention is focused on certain exemplary dyadic operators, which, because of their geometrical properties, would appear particularly basic; the algebra of these dyadics is developed in detail. The algebra is then (...) used in a derivation of the expansion of general functions of these dyadics. Several applications of the general expansion are presented: the inverse of a general dyadic operator (when it exists), a general rotation operator that includes strains and reflections, the determinant of a general dyadic operator, and operators, including some new ones, used in constructing Lorentz boosts. Finally, a coordinate-free representation of the Levi-Civita tensor is provided. (shrink)

By examining the highly contested legal debate about the regulation of pornography through an epistemic lens, this book analyzes competing claims about the proper role of speech in our society, pornography’s harm, the relationship between speech and equality, and whether law should regulate and, if so, upon what grounds.

We study the computational complexity of the model checking problem for quantifier-free dependence logic ${(\mathcal{D})}$ formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).

This paper is concerned with the target tracking problem of an autonomous surface vehicle in the presence of a maneuvering target. The velocity information of target is totally unknown to the follower vehicle, and only the relative distance and angle between the target and follower are obtained. First, a reduced-order extended state observer is used to estimate the unknown relative dynamics due to the unavailable velocity of the target. Based on the reduced-order extended state observer, an antidisturbance guidance law for (...) target tracking is designed. The input-to-state stability of the closed-loop target tracking guidance system is analyzed via cascade theory. Furthermore, the above result is extended to the case that collisions between the target and leader are avoided during tracking, and a collision-free target tracking guidance law is developed. The main feature of the proposed guidance law is twofold. First, the target tracking can be achieved without using the velocity information of the target. Second, collision avoidance can be achieved during target tracking. Simulation results show the effectiveness of the proposed antidisturbance guidance law for tracking a maneuvering target with the arbitrary bounded velocity. (shrink)

This paper contains a proposal for a free, nonzero-rest-mass particle’s proper spacetime, determined exclusively by the particle’s rest mass \ and numbers. The approach defines proper time as de Broglie time, which is isomorphic to a sequence of natural numbers \ that count de Broglie time units \\). The approach is based on defining the spatial coordinate as proper following the constructive definition of positive and negative integers as all possible differences of ordered pairs of natural numbers multiplied by (...) the Compton unit \\). The spatial and temporal coordinates that form the particle’s proper spacetime are constructed as Euclidean projections of the de Broglie time. The corresponding expression in the form of an energy-momentum relation reveals the existence, aside from the rest energy term \, of an additional energy term of the same order of magnitude, which is related to large intervals of the \-particle’s proper space. The relation of the numbers-based approach to the foundations of the special theory of relativity and of quantum mechanics is discussed. (shrink)

While Ç ´Ò¿ µ methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies, has not yet been provided. This paper presents such an algorithm, and shows its correctness and advantages over prior work. The paper finishes by bringing out the connections between the algorithm and work on hypergraphs, which permits us to extend the presented Viterbi (best parse) algorithm to an inside (total (...) probability) algorithm. (shrink)

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe (...) sentence can be characterized by a formula of a simple syntactic form. (shrink)

A description of the free cyclic algebra over the variety of Solovay algebras, as well as over its pyramid locally finite subvarieties is given.

This book defends an event-causal theory of libertarian free will and argues that the belief in such free will plays an important, if not essential, role in supporting certain important values. In the first part of the book, the author argues that possession of libertarian free will is necessary for deserved praise and blame and reward and punishment. He contends that his version of libertarian free will-the indeterministic weightings view- is coherent and can fit with a (...) scientific, naturalistic understanding of human nature. However, the author also notes that we don't have sufficient evidentiary grounds to believe that human beings have this kind of free will. Despite this, he argues there are sufficiently strong value-based/axiological reasons to believe we have such free will and to live an act as if we have it. In the second part of the book, the author makes the case that the belief in such libertarian, desert-grounding free will is very important to defending human dignity in the context of criminal justice, making sense of justified pride and its value, and adding value to our relationships. Free Will's Value will be of interest to scholars and advanced students working in metaphysics, philosophy of mind, action theory, ethics, and the philosophy of law. (shrink)