The paraconsistent system CPQ-ZFC/F is defined. It is shown using strong non-finitary methods that the theorems of CPQ-ZFC/F are exactly the theorems of classical ZFC minus foundation. The proof presented in the paper uses the assumption that a strongly inaccessible cardinal exists. It is then shown using strictly finitary methods that CPQ-ZFC/F is non-trivial. CPQ-ZFC/F thus provides a formulation of set theory that has the same deductive power as the corresponding classical system but is more reliable in that non-triviality is (...) provable by strictly finitary methods. This result does not contradict Gödel's incompleteness theorem because the proof of the deductive equivalence of the paraconsistent and classical systemss use non-finitary methods. (shrink)

In this paper we study a classical and theoretical system which consists of an elastic medium carrying transverse waves and one point-like high elastic medium density, called concretion. We compute the equation of motion for the concretion as well as the wave equation of this system. Afterwards we always consider the case where the concretion is not the wave source any longer. Then the concretion obeys a general and covariant guidance formula, which leads in low-velocity approximation to an equivalent de (...) Broglie-Bohm guidance formula. The concretion moves then as if exists an equivalent quantum potential. A strictly equivalent free Schrödinger equation is retrieved, as well as the quantum stationary states in a linear or spherical cavity. We compute the energy of the concretion, naturally defined from the energy density of the vibrating elastic medium. Provided one condition about the amplitude of oscillation is fulfilled, it strikingly appears that the energy and momentum of the concretion not only are written in the same form as in quantum mechanics, but also encapsulate equivalent relativistic formulas. (shrink)

We investigate strictly positive finitely additive measures on Boolean algebras and strictly positive Radon measures on compact zerodimensional spaces. The motivation is to find a combinatorial characterisation of Boolean algebras which carry a strictly positive finitely additive finite measure with some additional properties, such as separability or nonatomicity. A possible consistent characterisation for an algebra to carry a separable separable positive measure was suggested by Talagrand in 1980, which is that the Stone space K of the algebra satisfies that its (...) space M(K) of measures is weakly separable, equivalently that C(K) embeds into l∞. We show that there is a ZFC example of a Boolean algebra (so of a compact space) which satisfies this condition and does not support a separable strictly positive measure. However, we use this property as a tool in a proof which shows that under MA+⇁ CH every atomless ccc Boolean algebra of size < c carries a nonatomic strictly positive measure. Examples are given to show that this result does not hold in ZFC. Finally, we obtain a characterisation of Boolean algebras that carry a strictly positive nonatomic measure in terms of a chain condition, and we draw the conclusion that under MA+⇁ CH every atomless ccc Boolean algebra satisfies this stronger chain condition. (shrink)

This paper introduces the logics of super-strict implications, where a super-strict implication is a strengthening of C.I. Lewis' strict implication that avoids not only the paradoxes of material implication but also those of strict implication. The semantics of super-strict implications is obtained by strengthening the (normal) relational semantics for strict implication. We consider all logics of super-strict implications that are based on relational frames for modal logics in the modal cube. it is shown (...) that all logics of super-strict implications are connexive logics in that they validate Aristotle's Theses and (weak) Boethius's Theses. A proof-theoretic characterisation of logics of super-strict implications is given by means of G3-style labelled calculi, and it is proved that the structural rules of inference are admissible in these calculi. It is also shown that validity in the S5-based logic of super-strict implications is equivalent to validity in G. Priest's negation-as-cancellation-based logic. Hence, we also give a cut-free calculus for Priest's logic. (shrink)

We analyse the system of ethical review of human research in the Baltic States by introducing the principle of equivalent stringency of ethical review, that is, research projects imposing equal risks and inconveniences on research participants should be subjected to equally stringent review procedures. We examine several examples of non-equivalence or asymmetry in the system of ethical review of human research: (1) the asymmetry between rather strict regulations of clinical drug trials and relatively weaker regulations of other types (...) of clinical biomedical research and (2) gaps in ethical review in the area of non-biomedical human research where some sensitive research projects are not reviewed by research ethics committees at all. We conclude that non-equivalent stringency of ethical review is at least partly linked to the differences in scope and binding character of various international legal instruments that have been shaping the system of ethical review in the Baltic States. Therefore, the Baltic example could also serve as an object lesson to other European countries which might be experiencing similar problems. (shrink)

The notion of strictly primitive recursive realizability is further investigated, and the realizable prenex sentences, which coincide with primitive recursive truths of classical arithmetic, are characterized as precisely those provable in transfinite progressions over a fragment of intuitionistic arithmetic. The progressions are based on uniform reflection principles of bounded complexity iterated along initial segments of a primitive recursively formulated system of notations for constructive ordinals. A semiformal system closed under a primitive recursively restricted -rule is described and proved equivalent to (...) the transfinite progressions with respect to the prenex sentences. (shrink)

We characterize, in terms of determinacy, the existence of 0 ♯♯ as well as the existence of each of the following: 0 ♯♯♯ , 0 ♯♯♯♯ ,0 ♯♯♯♯♯ , .... For k ∈ ω, we define two classes of sets, (k * Σ 0 1 ) * and (k * Σ 0 1 ) * + , which lie strictly between $\bigcup_{\beta and Δ(ω 2 -Π 1 1 ). We also define 0 1♯ as 0 ♯ and in general, 0 (...) (k + 1)♯ as (0 k♯) ♯ . We then show that the existence of 0 (k + 1)♯ is equivalent to the determinacy of ((k + 1) * Σ 0 1 ) * as well as the determinacy of (k * Σ 0 1 ) * +. (shrink)

The equivalence of leaf languages of tree adjoining grammars and monadic linear context-free grammars was shown about a decade ago. This paper presents a proof of the strong equivalence of these grammar formalisms. Non-strict tree adjoining grammars and monadic linear context-free grammars define the same class of tree languages. We also present a logical characterisation of this tree language class showing that a tree language is a member of this class iff it is the two-dimensional yield of (...) an MSO-definable three-dimensional tree language. (shrink)

Leibniz Equivalence is a principle of applied mathematics that is widely assumed in both general relativity textbooks and in the philosophical literature on Einstein’s hole argument. In this article, I clarify an ambiguity in the statement of this Leibniz Equivalence, and argue that the relevant expression of it for the hole argument is strictly false. I then show that the hole argument still succeeds as a refutation of manifold substantivalism; however, recent proposals that the hole argument is undermined (...) by principles of representational equivalence do not fare so well. (shrink)

Two classically equivalent, but constructively inequivalent, strict convexity properties of a preference relation are discussed, and conditions given under which the stronger notion is a consequence of the weaker. The last part of the paper introduces uniformly rotund preferences, and shows that uniform rotundity implies strict convexity. The paper is written from a strictly constructive point of view, in which all proofs embody algorithms. MSC: 03F60, 90A06.

We introduce a new family of jump operators on Borel equivalence relations; specifically, for each countable group [Formula: see text] we introduce the [Formula: see text]-jump. We study the elementary properties of the [Formula: see text]-jumps and compare them with other previously studied jump operators. One of our main results is to establish that for many groups [Formula: see text], the [Formula: see text]-jump is proper in the sense that for any Borel equivalence relation [Formula: see text] the (...) [Formula: see text]-jump of [Formula: see text] is strictly higher than [Formula: see text] in the Borel reducibility hierarchy. On the other hand, there are examples of groups [Formula: see text] for which the [Formula: see text]-jump is not proper. To establish properness, we produce an analysis of Borel equivalence relations induced by continuous actions of the automorphism group of what we denote the full [Formula: see text]-tree, and relate these to iterates of the [Formula: see text]-jump. We also produce several new examples of equivalence relations that arise from applying the [Formula: see text]-jump to classically studied equivalence relations and derive generic ergodicity results related to these. We apply our results to show that the complexity of the isomorphism problem for countable scattered linear orders properly increases with the rank. (shrink)

It would seem that some statements like ‘There are exactly four moons of Jupiter’ and ‘The number of moons of Jupiter is four’ have the same truth-conditions and yet differ in ontological commitment. One strategy to resolve this paradoxical phenomenon is to insist that the statements have not only the same truth-conditions but also the same ontological commitments; the other strategy is to reject the presumption that they have the same truth-conditions. This paper critically examines some popular versions of these (...) two strategies, and defends a new solution according to which the statements have the same ontological commitments and yet differ in truth-conditions. (shrink)

When real-valued utilities for outcomes are bounded, or when all variables are simple, it is consistent with expected utility to have preferences defined over probability distributions or lotteries. That is, under such circumstances two variables with a common probability distribution over outcomes – equivalent variables – occupy the same place in a preference ordering. However, if strict preference respects uniform, strict dominance in outcomes between variables, and if indifference between two variables entails indifference between their difference and the (...) status quo, then preferences over rich sets of unbounded variables, such as variables used in the St. Petersburg paradox, cannot preserve indifference between all pairs of equivalent variables. In such circumstances, preference is not a function only of probability and utility for outcomes. Then the preference ordering is not defined in terms of lotteries. (shrink)

The neutral theory of biodiversity assumes that coexisting organisms are equally able to survive, reproduce and disperse, but predicts that stochastic fluctuations of these abilities drive diversity dynamics. It predicts remarkably well many biodiversity patterns, although substantial evidence for the role of niche variation across organisms seems contradictory. Here, we discuss this apparent paradox by exploring the meaning and implications of ecological equivalence. We address the question whether neutral theory provides an explanation for biodiversity patterns and acknowledges causal processes. (...) We underline that ecological equivalence, although central to neutral theory, can emerge at local and regional scales from niche-based processes through equalizing and stabilizing mechanisms. Such emerging equivalence corresponds to a weak conception of neutral theory, as opposed to the assumption of strict equivalence at individual level in the strong conception. We show that this duality is related to diverging views on hypothesis-testing and modeling in ecology. In addition, the stochastic dynamics exposed in neutral theory are pervasive in ecological systems and, rather than a null hypothesis, ecological equivalence is best understood as a parsimonious baseline to address biodiversity dynamics at multiple scales. (shrink)

In this paper we investigate some basic semantic and syntactic conditions characterizing the equivalence connective. In particular we define three basic classes of algebras: the class of weak equivalential algebras, the class of equivalential algebras and the class of regular equivalential algebras.Weak equivalential algebras can be used to study purely equivalential fragments of relevant logics and strict equivalential fragments of some modal logics. Equivalential algebras are suitable to study purely equivalential fragment of BCI and BCK logic. A subclass (...) of the class of regular equivalential algebras is suitable to study equivalential fragments of ukasiewicz logics. Some subvarieties of the class of regular equivalential algebras provide natural semantics for equivalential fragments of the intuitionistic prepositional logic and various intermediate logics. (shrink)

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants Kripke-Feferman truth. The first, KF+CONS, features a consistent but partial truth predicate. The second, KF+COMP, an inconsistent but complete truth predicate. It is well-known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability under natural assumptions coincides with definitional (...) equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of KF+CONS and KF+COMP raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth. (shrink)

We construct two models containing exactly one supercompact cardinal in which all non-supercompact measurable cardinals are strictly taller than they are either strongly compact or supercompact. In the first of these models, level by level equivalence between strong compactness and supercompactness holds. In the other, level by level inequivalence between strong compactness and supercompactness holds. Each universe has only one strongly compact cardinal and contains relatively few large cardinals.

When are two formal theories of broadly logical concepts, such as truth, equivalent? The paper investigates a case study, involving two well-known variants of Kripke–Feferman truth. The first, \, features a consistent but partial truth predicate. The second, \, an inconsistent but complete truth predicate. It is known that the two truth predicates are dual to each other. We show that this duality reveals a much stricter correspondence between the two theories: they are intertraslatable. Intertranslatability, under natural assumptions, coincides with (...) definitional equivalence, and is arguably the strictest notion of theoretical equivalence different from logical equivalence. The case of \ and \ raises a puzzle: the two theories can be proved to be strictly related, yet they appear to embody remarkably different conceptions of truth. We discuss the significance of the result for the broader debate on formal criteria of conceptual reducibility for theories of truth. (shrink)

One of the relations used with granularity is indistinguishability, where distinguishable entities in a finer-grained granule are indistinguishable in a coarser-grained granule. This relation is a subtype of equivalence relation, which is used in the other direction to create finer-grained granules. Together with the notion of similarity, we formally prove some intuitive properties of the indistinguishability relation for both qualitative and quantitative granularity, that with a given granulation there must be at least two granules (levels of granularity) for it (...) to be granular, and derive a strict order between finer and coarser granules. Based on these results, granulation hierarchy is defined as extra assisting structure to augment implementations. (shrink)

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver [20] and Harrington, Kechris and Louveau [6] show that with respect to Borel reducibility, any Borel equivalence relation strictly above equality on ω is above equality on , the power set of ω, and any Borel equivalence relation strictly above equality on the reals is above equality modulo finite on . In this article we (...) examine the effective content of these and related results by studying effectively Borel equivalence relations under effectively Borel reducibility. The resulting structure is complex, even for equivalence relations with finitely many equivalence classes. However use of Kleene’s O as a parameter is sufficient to restore the picture from the noneffective setting. A key lemma is that of the existence of two effectively Borel sets of reals, neither of which contains the range of the other under any effectively Borel function; the proof of this result applies Barwise compactness to a deep theorem of Harrington establishing for any recursive ordinal α the existence of singletons whose α-jumps are Turing incomparable. (shrink)

In the realm of Lindelöf metric spaces the following results are obtained in : (i) If is a Lindelöf metric space then it is both densely Lindelöf and almost Lindelöf. In addition, under the countable axiom of choice, the three notions coincide. (ii) The statement “every separable metric space is almost Lindelöf” implies that every infinite subset of has a countably infinite subset). (iii) The statement “every almost Lindelöf metric space is quasi totally bounded implies. (iv) The proposition “every quasi (...) totally bounded metric space is separable” lies, in the deductive hierarchy of choice principles, strictly between the countable union theorem and. Likewise, the statement “every pre‐Lindelöf (or Lindelöf) metric space is separable” lies strictly between and. (shrink)

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

We show that a finitely generated protoalgebraic strict universal Horn class that is filter-distributive is finitely based. Equivalently, every protoalgebraic and filter-distributive multidimensional deductive system determined by a finite set of finite matrices can be presented by finitely many axioms and rules.

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and Δ-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics–namely the class of algebras defined over the real unit (...) interval, the rational unit interval, the hyperreals , the strict hyperreals and finite chains, respectively–and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. (shrink)

Suppose $\lambda$ is a singular cardinal of uncountable cofinality $\kappa$. For a model $\mathscr{M}$ of cardinality $\lambda$, let No ($\mathscr{M}$) denote the number of isomorphism types of models $\mathscr{N}$ of cardinality $\lambda$ which are L$_{\infty\lambda}$- equivalent to $\mathscr{M}$. In [7] Shelah considered inverse $\kappa$- systems $\mathscr{A}$ of abelian groups and their certain kind of quotient limits Gr($\mathscr{A}$)/ Fact($\mathscr{A}$). In particular Shelah proved in [7, Fact 3.10] that for every cardinal $\mu$ there exists an inverse $\kappa$-system $\mathscr{A}$ such that $\mathscr{A}$ consists (...) of abelian groups having cardinality at most $\mu^\kappa$ and card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)) = $\mu$. Later in [8, Theorem 3.3] Shelah showed a strict connection between inverse $\kappa$-systems and possible values of No (under the assumption that $\theta^\kappa < \lambda$ for every $\theta < \lambda$): if $\mathscr{A}$ is an inverse $\kappa$- system of abelian groups having cardinality < $\lambda$, then there is a model $\mathscr{M}$ such that card $(\mathscr{M}) = \lambda$ and No($\mathscr{M}$) = card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)). The following was an immediate consequence (when $\theta^\kappa < \lambda$ for every $\theta < \lambda$): for every nonzero $\mu < \lambda$ or $\mu = \lambda^\kappa$ there is a model $\mathscr{M}_\mu$ of cardinality $\lambda$ with No$(\mathscr{M}_\mu) = \mu$. In this paper we show: for every nonzero $\mu \leq \lambda^\kappa$ there is an inverse $\kappa$-system $\mathscr{A}$ of abelian groups having cardinality < $\lambda$ such that card(Gr($\mathscr{A}$)/Fact($\mathscr{A}$)) = $\mu$ (under the assumptions $2^\kappa < \lambda$ and $\theta^{<\kappa} < \lambda$ for all $\theta < \lambda$ when $\mu > \lambda$), with the obvious new consequence concerning the possible value of No. Specifically, the case No($\mathscr{M}$) = $\lambda$ is possible when $\theta^\kappa < \lambda$ for every $\theta < \lambda$. (shrink)

Suppose λ is a singular cardinal of uncountable cofinality κ. For a model M of cardinality λ, let No (M) denote the number of isomorphism types of models N of cardinality λ which are L ∞λ - equivalent to M. In [7] Shelah considered inverse κ- systems A of abelian groups and their certain kind of quotient limits Gr(A)/ Fact(A). In particular Shelah proved in [7, Fact 3.10] that for every cardinal μ there exists an inverse κ-system A such that (...) A consists of abelian groups having cardinality at most μ κ and card(Gr(A)/Fact(A)) = μ. Later in [8, Theorem 3.3] Shelah showed a strict connection between inverse κ-systems and possible values of No (under the assumption that $\theta^\kappa for every $\theta ): if A is an inverse κ- system of abelian groups having cardinality $\theta^\kappa for every $\theta ): for every nonzero $\mu or μ = λ κ there is a model M μ of cardinality λ with No(M μ ) = μ. In this paper we show: for every nonzero μ ≤ λ κ there is an inverse κ-system A of abelian groups having cardinality $2^\kappa and $\theta^{ for all $\theta when $\mu > \lambda$ ), with the obvious new consequence concerning the possible value of No. Specifically, the case No(M) = λ is possible when $\theta^\kappa for every $\theta. (shrink)

This paper discusses random utility representations of the Luce model. Earlier works, such as McFadden, Yellott, and Strauss have discussed random utility representations under the assumption that utilities are additively separable in a deterministic and a random part. Under various conditions, they have established that a separable and independent random utility representation exists if and only if the random terms are type III extreme value distributed. This paper analyzes independent random utility representations without the separability condition and with an infinite (...) universal set of alternatives. Under these assumptions, it turns out that the most general random utility representation of the Luce model is a utility function that is an arbitrary strictly increasing transformation of a separable utility function with extreme value distributed random terms. (shrink)

This paper is devoted to a consequence relation combining the negation of Classical Logic ) and a paraconsistent negation based on Graham Priest’s Logic of Paradox ). We give a number of natural desiderata for a logic \ that combines both negations. They are motivated by a particular property-theoretic perspective on paraconsistency and are all about warranting that the combining logic has the same characteristics as the combined logics, without giving up on the radically paraconsistent nature of the paraconsistent negation. (...) We devise the logic \ by means of an axiomatization and three equivalent semantical characterizations. By showing that this logic is maximally paraconsistent, we prove that \ is the only logic satisfying all postulated desiderata. Finally we show how the logic’s infinite-valued semantics permits defining different types of entailment relations. (shrink)

Nelson’s programme for a stochastic mechanics aims to derive the wave function and the Schroedinger equation from natural conditions on a diffusion process in configuration space. If successful, this pro- gramme might have some advantages over the better-known determin- istic pilot-wave theory of de Broglie and Bohm. The essential points of Nelson’s strategy are reviewed, with particular emphasis on concep- tual issues relating to the role of time symmetry. The main problem in Nelson’s approach is the lack of strict (...) equivalence between the cou- pled Madelung equations and the Schroedinger equation. After a brief discussion, the paper concludes with a possible suggestion for trying to overcome this problem. (shrink)

This paper investigates the formal relationship between two prominent approaches to the logic of belief change. The first one uses the idea of "relational partial meet contractions" as developed by Alchourrón, Gärdenfors and Makinson (Journal of Symbolic Logic 1985), the second one uses the concept of "epistemic entrenchment" as elaborated by Gärdenfors and Makinson (in Theoretical Aspects of Reasoning about Knowledge, M. Y. Vardi, Los Altos 1988). The two approaches are shown to be strictly equivalent via direct links between the (...) underlying formal relations. The paper closes with observations about the application of epistemic entrenchment to simple and iterated revisions. (shrink)

Amongst contemporary theorists, the most widespread interpretation of Hegel's theory of punishment is that it is a retributivist theory of annulment, where punishments cancel the performance of crimes. The theory is retributivist insofar as the criminal punished must be demonstrated to be deserving of a punishment that is commensurable in value only to the nature of his crime, rather than to any consequentialist considerations. As Antony Duff says: [retributivism] justifies punishment in terms not of its contingently beneficial effects but of (...) its intrinsic justice as a response to crime; the justificatory relationship holds between present punishment and past crime, not between present punishment and future effects. Punishment is given only to persons responsible for committing crime. In addition, the degree of punishment is set in proportion to the relative badness of the precipitating crime. Thus, retributivism can be understood as an individualistic theory because the only relevant factors pertain solely to the individual criminal himself. The general attraction of Hegel's version of retributivism is that the punishments his theory is thought to endorse are commensurable in value with precipitating crimes, in contrast to the strict equivalence required by Kant's theory of punishment. As a result, Hegel's theory is praised both for being more acceptable to modern readers than Kant's so-called ‘pure retributivism’, as well as for being an ‘emphatically anti-utilitarian’ theory. Despite widespread agreement on these general features, it is hotly contested how exactly we are to understand the way in which punishment cancels crimes, and Hegel's difficult style has only served to make the controversy deeper. For example, Ted Honderich says: ‘A punishment is an annulment, a cancellation or a return to a previous state of affairs … All this, of course, is obscure. It is by Hegel’. (shrink)

La connaissance du social ne va pas de soi. Historiquement, la plupart des fondateurs de la sociologie ont réexaminé l'ensemble du système des sciences : en suivant, ou en rejetant, les modèles issus de la physique ou de la biologie, ils cherchent à constituer une autonomie de cette connaissance qui reste fidèle à l'idée qu'ils se font d'une science. C'est toute la question d'une sociologie bâtie et défendue à l'aune du modèle des sciences de la nature que ce volume cherche (...) à explorer, à la fois sous l'angle historique de sa constitution, et sous l'angle épistémologique de sa relation avec son objet. En effet, l'épistémologie classique, fondée dans une très large mesure sur l'étude des sciences de la nature, n'a pas vraiment été à même de rendre compte de la spécificité des sciences sociales, souvent accusées de ne pas satisfaire de critères suffisants de justification. Or la sociologie établit un lien propre avec son objet, car elle s'adresse à lui, et s'occupe des problèmes qui sont l'actualité même du monde social. A cause de ce lien, la sociologie n'est donc ni un strict équivalent d'une physique du social, ni une simple discipline historique qui se centrerait sur le monde contemporain : elle est engagée, d'une certaine manière, dans un dialogue avec la société, et l'analyse historique du développement de la sociologie permet de montrer comment elle a construit cette relation, à travers les métamorphoses de la question sociale. Dès lors, à la logique de la découverte et à celle de la justification, traditionnelles dans la philosophie des sciences, il faut adjoindre ce que l'on pourrait appeler une logique de la réception. C'est ce qui est proposé ici, à travers une approche phénoménologique et dans la ligné des travaux, entre autres, de Gadamer, Habermas et Jauss, sous le terme plus générique d'épistémologie de la réception. (shrink)

Many writers accept the following thesis about responsibility: (R) For one to be responsible for something is for one to be such that it is fitting that one be the object of some reactive attitude with respect to that thing. This thesis bears a striking resemblance to a thesis about value that is also accepted by many writers: (V) For something to be good (or neutral, or bad) is for it to be such that it is fitting that it be (...) the object of some pro-attitude (or indifference, or some contra-attitude). V has been the subject of intense debate in recent years, in part because of its incorporation into what has come to be called the “buck-passing” account of value. In particular, V is open to three challenges: that it is not necessarily the case that whatever is good is the fitting object of a pro-attitude; that it is not necessarily the case that whatever is the fitting object of a pro-attitude is good; and that, even if there is a strict equivalence between what is good and what is the fitting object of a pro-attitude, still the former is not to be analyzed in terms of the latter. The resemblance between V and R has not been previously commented on, but, once it is recognized, it is clear that R is open to challenges that resemble those to which V is vulnerable. This paper explores both the challenges to V and the parallel challenges to R and discusses responses that may be given to these challenges. The interrelation between V and R is then examined, and a general lesson is drawn concerning how to adjudicate disputes about the nature of moral responsibility. (shrink)

The purpose of this paper is to analyse and compare two concepts which tend to be treated as synonymous, and to show the difference between them: these are critical thinking and logical culture. Firstly, we try to show that these cannot be considered identical or strictly equivalent: i.e. that the concept of logical culture includes more than just critical thinking skills. Secondly, we try to show that Christian philosophers, when arguing about philosophical matters and teaching philosophy to students, should not (...) focus only on critical thinking skills, but rather also consider logical culture. This, as we argue, may help to improve debate both within and outside of Christian philosophy. (shrink)

There are logics where necessity is defined by means of a given identity connective: \ is a tautology). On the other hand, in many standard modal logics the concept of propositional identity \ can be defined by strict equivalence \}\). All these approaches to modality involve a principle that we call the Collapse Axiom : “There is only one necessary proposition.” In this paper, we consider a notion of PI which relies on the identity axioms of Suszko’s non-Fregean (...) logic SCI. Then S3 proves to be the smallest Lewis modal system where PI can be defined as SE. We extend S3 to a non-Fregean logic with propositional quantifiers such that necessity and PI are integrated as non-interdefinable concepts. CA is not valid and PI refines SE. Models are expansions of SCI-models. We show that SCI-models are Boolean prealgebras, and vice-versa. This associates non-Fregean logic with research on Hyperintensional Semantics. PI equals SE iff models are Boolean algebras and CA holds. A representation result establishes a connection to Fine’s approach to propositional quantifiers and shows that our theories are conservative extensions of S3–S5, respectively. If we exclude the Barcan formula and a related axiom, then the resulting systems are still complete w.r.t. a simpler denotational semantics. (shrink)

-/- Amongst contemporary theorists, the most widespread interpretation of Hegel's theory of punishment is that it is a retributivist theory of annulment, where punishments cancel the performance of crimes. The theory is retributivist insofar as the criminal punished must be demonstrated to be deserving of a punishment that is commensurable in value only to the nature of his crime, rather than to any consequentialist considerations. As Antony Duff says: -/- [retributivism] justifies punishment in terms not of its contingently beneficial effects (...) but of its intrinsic justice as a response to crime; the justificatory relationship holds between present punishment and past crime, not between present punishment and future effects. -/- Punishment is given only to persons responsible for committing crime. In addition, the degree of punishment is set in proportion to the relative badness of the precipitating crime. Thus, retributivism can be understood as an individualistic theory because the only relevant factors pertain solely to the individual criminal himself. -/- The general attraction of Hegel's version of retributivism is that the punishments his theory is thought to endorse are commensurable in value with precipitating crimes, in contrast to the strict equivalence required by Kant's theory of punishment. As a result, Hegel's theory is praised both for being more acceptable to modern readers than Kant's so-called ‘pure retributivism’, as well as for being an ‘emphatically anti-utilitarian’ theory. Despite widespread agreement on these general features, it is hotly contested how exactly we are to understand the way in which punishment cancels crimes, and Hegel's difficult style has only served to make the controversy deeper. For example, Ted Honderich says: ‘A punishment is an annulment, a cancellation or a return to a previous state of affairs … All this, of course, is obscure. It is by Hegel’. (shrink)

Contemporary philosophers have overall studied intentional actions that agents attempt to perform in the world. However, logicians of action have tended to neglect the intentionality proper to human action. I will present here the basic principles and laws of a logic of action where intentional actions are primary as in contemporary philosophy of action. In my view, any action that an agent performs unintentionally could in principle have been attempted. Moreover any unintentional action of an agent is an effect of (...) intentional actions of that agent. So my logic of action contains a theory of attempts. As Belnap pointed out, action, branching time and historic modalities are logically related. There is the liberty of voluntary action. I will then work out a logic of action that is compatible with indeterminism. In classical philosophical logic, propositions with the same truth-conditions are identified. However it is clear that strictly equivalent propositions are not the contents of the same attitudes of human agents. For that reason I will first present a non-classical propositional logic capable of distinguishing the contents of intentional actions which are different. Next I will enrich earlier logics of action so as to characterize adequately intentional actions, attempts and purposes of agents and the different kinds of generation of action. I will state the basic laws of agentive commitment and action generation. (shrink)

In two early papers, Max Cresswell constructed two formal logics of propositional identity, pcr and fcr, which he observed to be respectively deductively equivalent to modal logics s4 and s5. Cresswell argued informally that these equivalences respectively “give . . . evidence” for the correctness of s4 and s5 as logics of broadly logical necessity. In this paper, I describe weaker propositional identity logics than pcr that accommodate core intuitions about identity and I argue that Cresswell’s informal arguments do not (...) firmly and without epistemic circularity justify accepting s4 or s5. I also describe how to formulate standard modal logics (k, s2, and their extensions) with strict equivalence as the only modal primitive. (shrink)

Abstract.Antje Jackelén's Time and Eternity successfully employs the method of correlation and a close study of the question of time to enter the dialogue between science and theology. Hermeneutical attention to language is a central element of this dialogue, but we must be aware that much science is untranslatable into ordinary language; it is when we get to the bigger metaphysical assumptions of science that true dialogue begins to happen. Thus, although the method of correlation is a useful way to (...) approach this dialogue, there is not a strict equivalence in this relationship. Theology needs science more than science needs theology. In speaking of time and God we must keep in mind the relational nature of classical Christian theism, even in its most austere forms. We should not read Enlightenment ideas of God back into the classical Christian tradition or neglect the apophatic emphasis in Christian theism, which warned against assuming knowledge of the divine nature. God's relation to time always lies beyond our understanding. Studying the effects of either the Newtonian or Einsteinian concepts of time on our theological concepts should not detract our attention from the “lived time” that characterizes human experience. Consideration of the notion of time in the Madhyamaka Buddhist tradition reminds us that we cannot control the inner reality of time and that for humans time is something to be considered pragmatically. (shrink)

Our purpose is to formulate a complete logic of propositions that takes into account the fact that propositions are both senses provided with truth values and contents of conceptual thoughts. In our formalization, propositions are more complex entities than simple functions from possible worlds into truth values. They have a structure of constituents (a content) in addition to truth conditions. The formalization is adequate for the purposes of the logic of speech acts. It imposes a stronger criterion of propositional identity (...) than strict equivalence. Two propositions P and Q are identical if and only if, for any illocutionary force F, it is not possible to perform with success a speech act of the form F(P) without also performing with success a speech act of the form F(Q). Unlike hyperintensional logic, our logic of propositions is compatible with the classical Boolean laws of propositional identity such as the symmetry and the associativity of conjunction and the reduction of double negation. (shrink)

In introductory logic courses the authors often limit their considerations to the truth-value operators. Then they write that conditionals and biconditionals of natural language ("if" and "if and only if") may be represented as material implications and equivalences ("⊃" and "≡"), respectively. Yet material implications are not suitable for conditionals. Lewis' strict implications are much better for this purpose. Similarly, strict equivalences are better for representing biconditionals (than material equivalences). In this paper we prove that the methods from (...) standard first courses in logic can be used for testing arguments with strict implications, strict equivalences and other operators which may represent connectives from natural language. (shrink)

The van Wijngaarden grammars are two-level grammars that present many interesting properties. In the present article I elaborate on six of these properties, to wit, (i) their being constituted by two grammars, (ii) their ability to generate (possibly infinitely many) strict languages and their own metalanguage, (iii) their context-sensitivity, (iv) their high descriptive power, (v) their productivity, or the ability to generate an infinite number of production rules, and (vi) their equivalence with the unrestricted, or Type-0, Chomsky grammars.

In this paper we study 12 four-valued logics arisen from Belnap's truth and/or knowledge four-valued lattices, with or without constants, by adding one or both or none of two new non-regular operations—classical negation and natural implication. We prove that the secondary connectives of the bilattice four-valued logic with bilattice constants are exactly the regular four-valued operations. Moreover, we prove that its expansion by any non-regular connective (such as, e.g., classical negation or natural implication) is strictly functionally complete. Further, finding axiomatizations (...) of the quasi varieties generated by the 12 logics involved (that prove to be varieties), we find naturell equational axiomatizations of these logics. Finally, applying Pynko's general theory of algebraizable sequential consequence operations, we also find equivalent natural sequentiell axiomatizations of the logics under consideration that expand either of two Pynko's sequential calculi for the constant-free truth-lattice four-valued logic. (shrink)