It is easy to prove in ZF− that a relation R satisfies the maximal condition if and only if its transitive hull R* does; equivalently: R is well-founded if and only if R* is. We will show in the following that, if the maximal condition is replaced by the chain condition, as is often the case in Algebra, the resulting statement is not provable in ZF− anymore . More precisely, we will prove that this statement is equivalent in ZF− to (...) the countable axiom of choice ACω. Moreover, applying this result we will prove that the axiom of dependent choices, restricted to partial orders as used in Algebra, already implies the general form for arbitrary relations as formulated first by Teichmüller and, independently, some time later by Bernays and Tarski. (shrink)

In epistemic logic, some axioms dealing with the notion of knowledge are rather convoluted and difficult to interpret intuitively, even though some of them, such as the axioms.2 and.3, are considered to be key axioms by some epistemic logicians. We show that they can be characterized in terms of understandable interaction axioms relating knowledge and belief or knowledge and conditional belief. In order to show it, we first sketch a theory dealing with the characterization of axioms in terms of interaction (...) axioms in modal logic. We then apply the main results and methods of this theory to obtain specific results related to epistemic and doxastic logics. (shrink)

We consider forcing axioms for suitable families of μ‐complete ‐c.c. forcing notions. We show that some form of the condition “ have a in ” is necessary. We also show some versions are really stronger than others.

In this paper we give axiom systems for classical and intuitionistic hybrid logic. Our axiom systems can be extended with additional rules corresponding to conditions on the accessibility relation expressed by so-called geometric theories. In the classical case other axiomatisations than ours can be found in the literature but in the intuitionistic case no axiomatisations have been published. We consider plain intuitionistic hybrid logic as well as a hybridized version of the constructive and paraconsistent logic N4.

We propose six axioms concerning when one candidate should defeat another in a democratic election involving two or more candidates. Five of the axioms are widely satisfied by known voting procedures. The sixth axiom is a weakening of Kenneth Arrow's famous condition of the Independence of Irrelevant Alternatives (IIA). We call this weakening Coherent IIA. We prove that the five axioms plus Coherent IIA single out a method of determining defeats studied in our recent work: Split Cycle. In particular, (...) Split Cycle provides the most resolute definition of defeat among any satisfying the six axioms for democratic defeat. In addition, we analyze how Split Cycle escapes Arrow's Impossibility Theorem and related impossibility results. (shrink)

The collapse models of arithmetic are inconsistent, nontrivial models obtained from ℕ and set out in the Logic of Paradox (LP). They are given a general treatment by Priest (Priest, 2000). Finite collapse models are decidable, and thus axiomatizable, because finite. LP, however, is ill-suited to normal axiomatic reasoning, as it invalidates Modus Ponens, and almost all other usual conditional inferences. I set out a logic, A3, first given by Avron (Avron, 1991), and give a first order axiom system (...) for the finite collapse models. I present some standard arithmetical axioms in addition to a cyclic axiom and prove that these axioms are sound and complete for the cyclic models, reporting a similar result for the heap models. The state of the situation for the each of the kinds of infinite collapse model is, however, left an open question. (shrink)

Logical matrices for orthomodular logic are introduced. The underlying algebraic structures are orthomodular lattices, where the conditional connective is the Sasaki arrow. An axiomatic calculusOMC is proposed for the orthomodular-valid formulas.OMC is based on two primitive connectives — the conditional, and the falsity constant. Of the five axiom schemata and two rules, only one pertains to the falsity constant. Soundness is routine. Completeness is demonstrated using standard algebraic techniques. The Lindenbaum-Tarski algebra ofOMC is constructed, and it is shown to (...) be an orthomodular lattice whose unit element is the equivalence class of theses ofOMC. (shrink)

We study conditions for a topological space to be metrizable, properties of metrizable spaces, and the role the axiom of choice plays in these matters.

It is natural to ask under what conditions negating a conditional is equivalent to negating its consequent. Given a bivalent background logic, this is equivalent to asking about the conjunction of Conditional Excluded Middle (CEM, opposite conditionals are not both false) and Weak Boethius' Thesis (WBT, opposite conditionals are not both true). In the system CI.0 of consequential implication, which is intertranslatable with the modal logic KT, WBT is a theorem, so it is natural to ask which instances of CEM (...) are derivable. We also investigate the systems CIw and CI of consequential implication, corresponding to the modal logics K and KD respectively, with occasional remarks about stronger systems. While unrestricted CEM produces modal collapse in all these systems, CEM restricted to contingent formulas yields the Alt2 axiom (semantically, each world can see at most two worlds), which corresponds to the symmetry of consequential implication. It is proved that in all the main systems considered, a given instance of CEM is derivable if and only if the result of replacing consequential implication by the material biconditional in one or other of its disjuncts is provable. Several related results are also proved. The methods of the paper are those of propositional modal logic as applied to a special sort of conditional. (shrink)

The axiom of recovery, while capturing a central intuition regarding belief change, has been the source of much controversy. We argue briefly against putative counterexamples to the axiom—while agreeing that some of their insight deserves to be preserved—and present additional recovery-like axioms in a framework that uses epistemic states, which encode preferences, as the object of revisions. This makes iterated revision possible and renders explicit the connection between iterated belief change and the axiom of recovery. We provide (...) a representation theorem that connects the semantic conditions we impose on iterated revision and our additional syntactical properties. We show interesting similarities between our framework and that of Darwiche–Pearl (Artificial Intelligence 89:1–29 1997). In particular, we show that intuitions underlying the controversial (C2) postulate are captured by the recovery axiom and our recovery-like postulates (the latter can be seen as weakenings of (C2)). We present postulates for contraction, in the same spirit as the Darwiche–Pearl postulates for revision, and provide a theorem that connects our syntactic postulates with a set of semantic conditions. Lastly, we show a connection between the contraction postulates and a generalisation of the recovery axiom. (shrink)

The Adams Thesis holds for a conditional → and a probability assignment P if and only if P=P whenever P>0. The restriction ensures that P is well defined by the classical formula P=P/P. Drawing on deep results of Maharam on measure algebras, it is shown that, notwithstanding well-known triviality results, any probability space can be extended to a probability space with a new conditional satisfying the Adams Thesis and satisfying a number of axioms for conditionals. This puts significant limits on (...) how far triviality results can go. (shrink)

There is no set Δ of probability axioms that meets the following three desiderata: (1) Δ is vindicated by a Dutch book theorem; (2) Δ does not imply regularity (and thus allows, among other things, updating by conditionalization); (3) Δ constrains the conditional probability q(·,z) even when the unconditional probability p(z) (=q(z,T)) equals 0. This has significant consequences for Bayesian epistemology, some of which are discussed.

We report on the mechanisation of (preference-based) conditional normative reasoning. Our focus is on Åqvist's system E for conditional obligation, and its extensions. Our mechanisation is achieved via a shallow semantical embedding in Isabelle/HOL. We consider two possible uses of the framework. The first one is as a tool for meta-reasoning about the considered logic. We employ it for the automated verification of deontic correspondences (broadly conceived) and related matters, analogous to what has been previously achieved for the modal logic (...) cube. The equivalence is automatically verified in one direction, leading from the property to the axiom. The second use is as a tool for assessing ethical arguments. We provide a computer encoding of a well-known paradox (or impossibility theorem) in population ethics, Parfit's repugnant conclusion. While some have proposed overcoming the impossibility theorem by abandoning the presupposed transitivity of ‘better than’, our formalisation unveils a less extreme approach, suggesting among other things the option of weakening transitivity suitably rather than discarding it entirely. Whether the presented encoding increases or decreases the attractiveness and persuasiveness of the repugnant conclusion is a question we would like to pass on to philosophy and ethics. (shrink)

The basic theory of preference relations contains a trivial part reflected by axioms A1 and A2, which say that preference relations are preorders. The next step is to find other axims which carry the theory beyond the level of the trivial. This paper is to a great part a critical survey of such suggested axioms. The results are much in the negative — many proposed axioms imply too strange theorems to be acceptable as axioms in a general theory of preference. (...) This does not exclude, of course, that they may well be reasonable axioms for special calculi of preference. I believe that many axioms which are rejected here may be plausible if their range of application is restricted by conditions which are possible to formulate only in a language richer than that of the propositional calculus, e.g. in one containing modal operators or probabilistic concepts. (shrink)

The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one obtains a system CI.0*Eq (...) in whose language one can define an operator ↠ suitable to formalize context-dependent conditionals (so to counterfactual conditionals) via the definition (Def ↠) A ↠ B = df *A ⥽ B ∧ Ξ (Α, Β).. The central problem of the paper is to identify inside CI.0*Eq + Def ↠ a set of axioms yielding the fragment consisting of all and only theorems in which only truth-functional operators and the two operators → and ↠ occur. This system, here called CI.0, is introduced in §3. In view of the intended purpose, it is introduced a complete and tableau-decidable system KTw, which is an extension of KT with axioms for the so-called quasi-variables w(A), w(B)… Three translation functions among the three languages used in the paper are then introduced. The first, Tr, maps every wff of form *A into wffs of form w(A) ∧ A and translates theorems of CI.0*Eq into theorems of KTw. The second, t°, translates theorems of CI.0 into theorems of CI.0*Eq by applying Def↠. A third one, t, translates theorems of CI.0 into theorems of KTw. As a consequence, it follows that t°A = TrtA. In §4 it is proved that CI.0 is complete w.r.t. the class of CI.0-models of form where f is a selection function and R an access relation. It is then proved (i) that CI.0 models may be converted into KTw-models; (ii) that the truth-value of a proposition in a world of a CI.0-model is preserved in the same world of the derived KTw-model; (iii) that A is a CI.0-thesis iff its translation tA is KTw-thesis. It follows that, if A is not a CI.0-thesis, tA is not a KTw-thesis, so also that TrtA is not a CI.0*Eq-thesis. Since t°A = TrtA and t°A is a function built on Def↠, this proves that every t°-translation of a CI.0-wff that is a CI.0*Eq-theorem is a CI.0-theorem. Since the converse proposition is proved in §2, their conjunction establishes the desired result. In the final section, it is proved that CI.0 is tableau-decidable, that ↠ is not a trivial operator and that ↠ enjoys the positive and negative properties required in §1 for context-dependent conditionals. Some final remarks suggest that studying the relations between CI.0 and systems of classical conditional logic may be a promising line of investigation. (shrink)

We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, (...) we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices. (shrink)

We consider choice correspondences that assign a subset to every choice set of alternatives, where the total set of alternatives is an arbitrary finite or infinite set. We focus on the relations between several extensions of the condition of independence of irrelevant alternatives on one hand, and conditions on the revealed preference relation on sets, notably the weak axiom of revealed preference, on the other hand. We also establish the connection between the condition of independence of irrelevant alternatives and (...) so-called strong sets; the latter characterize a social choice correspondence satisfying independence of irrelevant alternatives. (shrink)

Algebraic quantum field theory (AQFT) puts forward three ``causal axioms'' that aim to characterize the theory as one that implements relativistic causation: the spectrum condition, microcausality, and primitive causality. In this paper, I aim to show, in a minimally technical way, that none of them fully explains the notion of causation appropriate for AQFT because they only capture some of the desiderata for relativistic causation I state or because it is often unclear how each axiom implements its respective desideratum. (...) After this diagnostic, I will show that a fourth condition, local primitive causality (LPC), fully characterizes relativistic causation in the sense of fulfilling all the relevant desiderata. However, it only encompasses the virtues of the other axioms because it is implied by them, as I will show from a construction by Haag and Schroer (1962). Since the conjunction of the three causal axioms implies LPC and other important results in QFT that LPC does not imply, and since LPC helps clarify some of the shortcomings of the three axioms, I advocate for a holistic interpretation of how the axioms characterize the causal structure of AQFT against the strategy in the literature to rivalize the axioms and privilege one among them. (shrink)

The most majestic scientific achievement, of this century in mathematical beauty, axiomatic consistency, and experimental verifications has been special relativity with its unitary structure at the operator level, and canonical structure at the classical levels, which has turned out to be exactly valid for point particles moving in the homogenenous and isotropic vacuum (exterior dynamical problems). In recent decades a number of authors have studied nonunitary and noncanonical theories, here generally calleddeformations for the representation of broader conditions, such as extended (...) and deformable particles moving within inhomogeneous and anisotrophic physical media (interior dynamical problems). In this paper we show that nonunitary deformations, including, q-, k-, quatum-, Lie-isotopic, Lie-admissible, and other deformations, even thoughmathematically correct, have a number of problematic aspects ofphysical character when formulated on conventional spaces over conditional fields, such as lack of invariance of the basic space-time units, ambiguous applicability to measurements, loss of Hermiticity-observability in time, lack of invariant numerical predictions, loss of the axions of special relativity, and others. We then show that the classical noncanonical counterparts of the above nonunitary deformations are equally afflicted by corresponding problems of physical consistency. We also show that the contemporary formulation of gravity is afflicted by similar problematic aspects because Riemannian spaces are noncanonical deformations of Minkowskian spaces, thus having noninvariant space-time units. We then point out that new mathematical methods, calledisotopies, genotopies, hyperstructures and their isoduals, offer the possibilities of constructing a nonunitary theory, known asrelativistic hadronic mechanics which: (1) is as axiomatically consistent as relativistic quantum mechanics, (2) preserves the abstract axioms of special relativity, and (3) results in a completion of the conventional mechanics much along the celebrated Einstein-Podolski-Rosen argument. A number of novel applications are indicated, such as a geometric unification of the special and general relativity via the isominkowskian geometry in which the two relativities are differentiated via the invariant basic unit, while preserving conventional Riemannian metrics, Einstein's field equations, and related experimental verifications; a novel operator form of gravity verifying the axioms of relativistic quantum mechanics under the universal isopoincaré symmetry; a new structure model of hadrons with conventional massive particles as physical constituents which is compatile with composite quarks and with established unitary classifications; and other novels applications in nuclear physics, astrophysics, theoretical biology, and other fields. The paper ends with the proposal of a number of new experiments, some of which may imply new practical applications, such as conceivable new forms of recycling nuclear waste. The achievement of axiomatic consistency in the study of the above physical problems has been possible for the first time in this paper thanks to mathematical advances that recently appeared in a special issue of theRendiconti Circolo Matematico Palermo, and in other journals identified in the Acknowledgements. (shrink)

The McKinsey axiom \((\textrm{M})\ \Box \Diamond p\rightarrow \Diamond \Box p\) has a local first-order correspondent on the class of all weakly transitive frames \({{\mathcal {W}}}{{\mathcal {T}}}\). It globally corresponds to Lemmon’s condition \(({\textsf{m}}^\infty )\) on \({{\mathcal {W}}}{{\mathcal {T}}}\). The formula \((\textrm{M})\) is canonical over the weakly transitive modal logic \(\textsf{wK4}={\textsf{K}}\oplus p\wedge \Box p\rightarrow \Box \Box p\). The modal logic \(\mathsf {wK4.1}=\textsf{wK4}\oplus \textrm{M}\) has the finite model property. The modal logics \(\mathsf {wK4.1T}_0^n\) ( \( n>0\) ) form an infinite descending (...) chain in the interval \([\mathsf {wK4.1},\mathsf {K4.1}]\) and each of them has the finite model property. Thus all the modal logics \(\mathsf {wK4.1}\) and \(\mathsf {wK4.1T}_0^n\) ( \(n>0\) ) are decidable. (shrink)

Based on a notion of "companions to stit formulas" applied in other papers dealing with astit logics, we introduce "choice formulas" and "nested choice formulas" to prove the completeness theorems for dstit logics in a language with the dstit operator as the only non-truth-functional operator. The main logic discussed in this paper is the basic logic of dstit with multiple agents, other logics discussed include the basic logic of dstit with a single agent and some logics of dstit with multiple (...) agents each of which corresponds to a semantic condition concerning the number of possible choices for agents. (shrink)

It is shown in Zermelo-Fraenkel Set Theory that Cκ, the Axiom of Choice for κ-indexed families of arbitrary sets, is equivalent to the condition that the frame envelope of any κ-frame is κ-Lindelöf, for any cardinal κ.

Choquet integrals and capacities play a crucial role in modern decision theory. Comonotony is a central concept for these theories because the main property of a Choquet integral is its additivity for comonotone functions. We consider a Choquet integral representation of preferences showing uncertainty aversion (pessimism) and propose axioms on time consistency which yield a candidate for conditional Choquet integrals. An other axiom characterizes the role of comonotony in the use of information. We obtain two conditioning rules for (...) capacities which amount to the well-known Bayes' and Dempster–Schafer's updating rules. We are allowed to interpret both of them as a lack of confidence in information in a dynamic extension of pessimism. (shrink)

Sequel to Armendt 1986, ‘A Foundation for Causal Decision Theory.’ The representation theorem for causal decision theory is slightly revised, with the addition of a new restriction on lotteries and a new axiom (A7). The discussion gives some emphasis to the way in which appropriate K-partitions are characterized by relations found among the agent’s conditional preferences. The intended interpretation of conditional preference is one that embodies a sensitivity to the agent’s causal beliefs.

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

It is natural and important to have a formal representation of plain belief, according to which propositions are held true, or held false, or neither. (In the paper this is called a deterministic representation of epistemic states). And it is of great philosophical importance to have a dynamic account of plain belief. AGM belief revision theory seems to provide such an account, but it founders at the problem of iterated belief revision, since it can generally account only for one step (...) of revision. The paper discusses and rejects two solutions within the confines of AGM theory. It then introduces ranking functions (as I prefer to call them now; in the paper they are still called ordinal conditional functions) as the proper (and, I find, still the best) solution of the problem, proves that conditional independence w.r.t. ranking functions satisfies the so-called graphoid axioms, and proposes general rules of belief change (in close analogy to Jeffrey's generalized probabilistic conditionalization) that encompass revision and contraction as conceived in AGM theory. Indeed, the parallel to probability theory is amazing. Probability theory can profit from ranking theory as well since it is also plagued by the problem of iterated belief revision even if probability measures are conceived as Popper measures (see No. 11). Finally, the theory is compared with predecessors which are numerous and impressive, but somehow failed to explain the all-important conditional ranks in the appropriate way. (shrink)

One of the main applications of the logic of theory change is to the epistemic analysis of conditionals via the so-called Ramsey test. In the first part of the present note this test is studied in the “limiting case” where the theory being revised is inconsistent, and it is shown that this case manifests an intrinsic incompatibility between the Ramsey test and the AGM postulate of “success”. The paper then analyses the use of the postulate of success, and a weakening (...) of it, generating axioms of conditional logic via the test, and it is shown that for certain purposes both success and weak success are quite superfluous. This suggests the proposal of abandoning both success and weak success entirely, thus permitting retention of the postulate of “preservation” discarded by Gärdenfors. (shrink)

Church's and Turing's theses dogmatically assert that an informal notion of effective calculability is adequately captured by a particular mathematical concept of computability. I present an analysis of calculability that is embedded in a rich historical and philosophical context, leads to precise concepts, but dispenses with theses. To investigate effective calculability is to analyze symbolic processes that can in principle be carried out by calculators. This is a philosophical lesson we owe to Turing. Drawing on that lesson and recasting work (...) of Gandy, I formulate boundedness and locality conditions for two types of calculators, namely, human computing agents and mechanical computing devices (discrete machines). The distinctive feature of the latter is that they can carry out parallel computations. The analysis leads to axioms for discrete dynamical systems (representing human and machine computations) and allows the reduction of models of these axioms to Turing machines. Cellular automata and a variety of artificial neural nets can be shown to satisfy the axioms for machine computations. (shrink)

In Zermelo-Fraenkel set theory with the axiom of choice every set has the same cardinal number as some ordinal. Von Rimscha has weakened this condition to “Every set has the same cardinal number as some transitive set”. In set theory without the axiom of choice, we study the deductive strength of this and similar statements introduced by von Rimscha.

Standard conditionals $\varphi > \psi$, by which I roughly mean variably strict conditionals à la Stalnaker and Lewis, are trivially true for impossible antecedents. This article investigates three modifications in a doxastic setting. For the neutral conditional, all impossible-antecedent conditionals are false, for the doxastic conditional they are only true if the consequent is absolutely necessary, and for the metaphysical conditional only if the consequent is ‘model-implied’ by the antecedent. I motivate these conditionals logically, and also doxastically by properties of (...) conditional belief and belief revision. For this I show that the Lewisian hierarchy of conditional logics can be reproduced within ranking semantics, provided we slightly stretch the notion of a ranking function. Given this, acceptance of a conditional can be interpreted as a conditional belief. The epistemic and the neutral conditional deviate from Lewis’ weakest system $V$, in that ID or even CN are dropped, and new axioms appear. The logic of the metaphysical conditional is completely axiomatised by $V$ to which we add the known Kripke axioms T5 for the outer modality. Related completeness results for variations of the ranking semantics are obtained as corollaries. (shrink)

In economics, it has often been claimed that testing choice data for violation of certain axioms-particularly if the choice data is observed under laboratory conditions-allows conclusions about the validity of certain preference axioms and the neoclassical maximization hypothesis. In this paper I argue that these conclusions are unfounded. In particular, it is unclear what exactly is tested, and the interpretation of the test results are ambiguous. Further, there are plausible reasons why the postulated choice axioms should not hold. Last, these (...) tests make implicit assumptions about beliefs that further blur the interpretations of the results. The tests therefore say little if anything about the validity of certain preference axioms or the maximization hypothesis. (shrink)

We discuss the problem raised by Miller to re-prove the well-known equivalences of some Lindenbaum theorems for deductive systems without an application of the Axiom of Choice. We present five special constructions of deductive systems, each of them providing some partial solutions to the mathematical problem. We conclude with a short discussion of the underlying philosophical problem of deciding, whether a given proof satisfies our demand that the Axiom of Choice is not applied.

We investigate the social choice implications of what we call "the proximity condition". Loosely speaking, this condition says that whenever a profile moves "closer" to some individual's point of view, then the social choice cannot move "further away" from this individual's point of view. We apply this idea in two settings: merging functions and preference aggregation. The precise formulation of the proximity condition depends on the setting. First, restricting attention to merging functions that are interval scale invariant, we prove that (...) the only functions that satisfy proximity are dictatorships. Second, we prove that the only social welfare functions that satisfy proximity and a version of the Pareto criterion are dictatorships. We conclude that either proximity is not an attractive normative requirement after all, or we must give up some other social choice condition. Another possibility is that our normative intuition about proximity needs to be codified using different axioms. (shrink)

We provide a new behavioral foundation for subjective expected utility within the Anscombe–Aumann framework. In contrast to the original axiomatization of SEU, our behavioral foundation establishes that to be consistent with SEU maximization, we need not explicitly assume that preferences satisfy the independence axiom over the domain of all acts. Rather, the substantive implications of independence for an SEU representation may equivalently be derived from less demanding conditions over certain smaller classes of acts. These acts, which we refer to (...) as uncertainty-free comparable acts, have the property that they are relatively simple for a decision maker to compare because she can rank acts within any such class based on her risk preferences alone, without having to consider the underlying uncertainty. Acts of this kind comprise constant acts and acts that are almost identical in the sense that they differ from one another in at most one state. (shrink)

Author considers cognitive assumptions of practical consciousness: some preconditions on which an interaction with the social and natural objects is based. Author follows the “constructivist" program in social theory in its classic version which is represented by social phenomenology and phenomenological sociology of knowledge (A. Schutz, P. Berger, T. Luckmann). Author analyzes some latent axioms and presuppositions, “idealizations" and mechanisms of everyday consciousness which constitute individual social experience at the level of micro-interactions with the objects and the “others". This analysis (...) also refers to the intellectual heritage of classical theory of knowledge (epistemological ideas of I. Kant, E. Husserl). Author considers the status of the Other in the elementary systems of social interaction; discusses the necessity to assume the relative constancy and uniformity of the objective world elements including the existence of an integral self-identical “I" (actor's personality). The organized process of social experience uninterruptedly operated by cognitive schemes of practical consciousness is considered as one of the main conditions of reproduction of coordinated routines which support social order and institutional structures of the society. (shrink)

Abstract.This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part function in order to deal with the case where the conditioning event has probability zero, and the use of a many-valued modal logic in order to deal probability of an event φ as the truth value of the sentence φ is probable, along the lines of Hájek’s book [H98] and of (...) [EGH96]. To this purpose, we introduce a probabilistic many-valued logic, called FP(SŁΠ), which is sound and complete with respect a class of structures having a non-standard extension [0,1]⋆ of [0,1] as set of truth values. We also prove that the coherence of an assessment of conditional probabilities is equivalent to the coherence of a suitably defined theory over FP(SŁΠ) whose proper axioms reflect the assessment itself. (shrink)

. Dzik [2] gives a direct proof of the axiom of choice from the generalized Lindenbaum extension theorem LET. The converse is part of every decent logical education. Inspection of Dzik’s proof shows that its premise let attributes a very special version of the Lindenbaum extension property to a very special class of deductive systems, here called Dzik systems. The problem therefore arises of giving a direct proof, not using the axiom of choice, of the conditional . A (...) partial solution is provided. (shrink)

In this paper we examine optimal bidding without the independence axiom in a unified framework which allows for a clear graphical representation. Thus, we can show very simply the independence axiom to be a necessary and sufficient condition on preferences for strategical equivalence of the two first-price and second-price auctions, respectively, and for the second-price sealed-bid auction to be demand revealing. The analysis reveals that the betweenness property is necessary and sufficient for the ascending-bid auction to be demand (...) revealing while optimal bids exceed (are less than) bidders' valuations, iff preferences are quasiconcave (quasiconvex). Furthermore, it can be shown that fanning out (fanning in) leads to a higher (lower) selling-price in open than in sealed-bid auctions. (shrink)

Bypassing Lewis’ Triviality Results. A Kripke-Style Partial Semantics for Compounds of Adams’ Conditionals Alberto Mura University of Sassari Abstract According to Lewis’ Triviality Results (LTR), conditionals cannot satisfy the equa­tion (E) P(C if A) = P(C | A), except in trivial cases. Ernst Adams (1975), however, provided a probabilistic semantics for the so-called simple conditionals that also sat­isfies equation (E) and provides a probabilistic counterpart of logical consequence (called p-entailment). Adams’ probabilistic semantics is coextensive to Stalnaker­Thomason’s (1970) and Lewis’ (1973) (...) semantics as far as simple conditionals are concerned. A theorem, proved in McGee 1981, shows that no truth-functional many-valued logic allows a relation of logical consequence coextensive with Adams’ p-entailment. This paper presents a modified modal (Kripke-style) version of de Finetti’s se­mantics that escapes McGee’s result and provides a general truth-conditional se­mantics for indicative conditionals. It agrees with Adams’ logic and is not affected by LTR. The new framework encompasses and extends Adams’ probabilistic se­mantics (APS) to compounds of conditionals. A generalised set of axioms for prob­ability over the set of tri-events is provided, which coincide with the standard axioms over the set of the two-valued ordinary sentences. -/- Keywords: Conditionals, Probability logic, de Finetti, Tri-events, Adams’ logic, Stal­naker’s thesis, Partial logic, Lewis’ triviality results, Ramsey test. (shrink)

A Partial Combinatory Algebra is completable if it can be extended to a total one. In [1] it is asked (question 11, posed by D. Scott, H. Barendregt, and G. Mitschke) if every PCA can be completed. A negative answer to this question was given by Klop in [12, 11]; moreover he provided a sufficient condition for completability of a PCA (M, ·, K, S) in the form of ten axioms (inequalities) on terms of M. We prove that just one (...) of these axiom (the so called Barendregt's axiom) is sufficient to guarantee (a slightly weaker notion of) completability. (shrink)

The rationalization of a choice function, in terms of assumptions that involve expansion or contraction properties of the feasible set, over non-finite sets is analyzed. Schwartz's results, stated in the finite case, are extended to this more general framework. Moreover, a characterization result when continuity conditions are imposed on the choice function, as well as on the binary relation that rationalizes it, is presented.

The basic axioms or formal conditions of decision theory, especially the ordering condition put on preferences and the axioms underlying the expected utility formula, are subject to a number of counter-examples, some of which can be endowed with normative value and thus fall within the ambit of a philosophical reflection on practical rationality. Against such counter-examples, a defensive strategy has been developed which consists in redescribing the outcomes of the available options in such a way that the threatened axioms or (...) conditions continue to hold. We examine how this strategy performs in three major cases: Sen's counterexamples to the binariness property of preferences, the Allais paradox of EU theory under risk, and the Ellsberg paradox of EU theory under uncertainty. We find that the strategy typically proves to be lacking in several major respects, suffering from logical triviality, incompleteness, and theoretical insularity. To give the strategy more structure, philosophers have developed “principles of individuation”; but we observe that these do not address the aforementioned defects. Instead, we propose the method of checking whether the strategy can overcome its typical defects once it is given a proper theoretical expansion. We find that the strategy passes the test imperfectly in Sen's case and not at all in Allais's. In Ellsberg's case, however, it comes close to meeting our requirement. But even the analysis of this more promising application suggests that the strategy ought to address the decision problem as a whole, rather than just the outcomes, and that it should extend its revision process to the very statements it is meant to protect. Thus, by and large, the same cautionary tale against redescription practices runs through the analysis of all three cases. A more general lesson, simply put, is that there is no easy way out from the paradoxes of decision theory. (shrink)

The paper studies the admissibility of some cancellation rules in normal modal systems with the Brouwerian axiom. For example, KDB and KTB are proved to admit the following rule: if ⊢ ¬ and ⊢ ⋄α ≡ ⋄β then ⊢ ¬. Two notions of the preservation of validity by a rule on a frame are defined; on both, the preservation of validity by the preceding rule is shown not to be a first-order condition. A speculative connection is suggested with logics (...) of vagueness. (shrink)