Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic provides an axiomatic (...) characterization of the full set of AGM postulates. © 2006 Elsevier B.V. All rights reserved. (shrink)

A number of rules for resolving majority cycles in elections have been proposed in the literature. Recently, Holliday and Pacuit (Journal of Theoretical Politics 33 (2021) 475-524) axiomatically characterized the class of rules refined by one such cycle-resolving rule, dubbed Split Cycle: in each majority cycle, discard the majority preferences with the smallest majority margin. They showed that any rule satisfying five standard axioms plus a weakening of Arrow’s Independence of Irrelevant Alternatives (IIA), called Coherent IIA, is refined by Split (...) Cycle. In this paper, we go further and show that Split Cycle is the only rule satisfying the axioms of Holliday and Pacuit together with two additional axioms, which characterize the class of rules that refine Split Cycle: Coherent Defeat and Positive Involvement in De- feat. Coherent Defeat states that any majority preference not occurring in a cycle is retained, while Positive Involvement in Defeat is closely related to the well-known axiom of Positive Involvement (as in J. Perez, Social Choice and Welfare 18 (2001) 601-616). We characterize Split Cycle not only as a collective choice rule but also as a social choice correspondence, over both profiles of linear ballots and profiles of ballots allowing ties. (shrink)

Afacan (Games and Economic Behavior 110: 71-89, 2018) introduces an object allocation with random priorities problem. He proposes the constrained probabilistic serial (CPS) mechanism. This study, for the first time in the literature, provides axiomatic characterizations of CPS. The first result characterizes it via non-wastefulness, claimwise stability, constrained ordinal fairness, and surplus invariance to truncations. The other axiomatizes CPS via constrained stochastic efficiency, claimwise stability, and constrained ordinal fairness. The independence of the axioms is provided.

This paper presents a belief revision operator that considers time intervals for modelling norm change in the law. This approach relates techniques from belief revision formalisms and time intervals with temporalised rules for legal systems. Our goal is to formalise a temporalised belief base and corresponding timed derivation, together with a proper revision operator. This operator may remove rules when needed or adapt intervals of time when contradictory norms are added in the system. For the operator, both constructive definition and (...) an axiomatic characterisation by representation theorems are given. (shrink)

This paper studies the causal interpretation of counterfactual sentences using a modifiable structural equation model. It is shown that two properties of counterfactuals, namely, composition and effectiveness, are sound and complete relative to this interpretation, when recursive (i.e., feedback-less) models are considered. Composition and effectiveness also hold in Lewis's closest-world semantics, which implies that for recursive models the causal interpretation imposes no restrictions beyond those embodied in Lewis's framework. A third property, called reversibility, holds in nonrecursive causal models but not (...) in Lewis's closest-world semantics, which implies that Lewis's axioms do not capture some properties of systems with feedback. Causal inferences based on counterfactual analysis are exemplified and compared to those based on graphical models. (shrink)

We study original position arguments in the context of social choice under ignorance. First, we present a general formal framework for such arguments. Next, we provide an axiomatic characterization of social choice rules that can be supported by original position arguments. We illustrate this characterization in terms of various well-known social choice rules, some of which do and some of which do not satisfy the axioms in question. Depending on the perspective one takes, our results can be (...) used to argue against certain rules, against Rawlsian theories of procedural fairness, or in support of richer, multidimensional models of individual choice. (shrink)

Journal of Political Philosophy, Volume 30, Issue 3, Page 370-394, September 2022.

We introduce two novel frameworks for choice under complete uncertainty. These frameworks employ intervals to represent uncertain utility attaching to outcomes. In the first framework, utility intervals arising from one act with multiple possible outcomes are aggregated via a set-based approach. In the second framework the aggregation of utility intervals employs multi-sets. On the aggregated utility intervals, we then introduce min–max decision rules and lexicographic refinements thereof. The main technical results are axiomatic characterizations of these min–max decision rules and (...) these refinements. We also briefly touch on the independence of introduced axioms. Furthermore, we show that such characterizations give rise to novel axiomatic characterizations of the well-known min–max decision rule?mnx?mnx in the classical framework of choice under complete uncertainty. (shrink)

Ranking finite subsets of a given set X of elements is the formal object of analysis in this article. This problem has found a wide range of economic interpretations in the literature. The focus of the article is on the family of rankings that are additively representable. Existing characterizations are too complex and hard to grasp in decisional contexts. Furthermore, Fishburn (1996), Journal of Mathematical Psychology 40, 64–77 showed that the number of sufficient and necessary conditions that are needed to (...) characterize such a family has no upper bound as the cardinality of X increases. In turn, this article proposes a way to overcome these difficulties and allows for the characterization of a meaningful (sub)family of additively representable rankings of sets by means of a few simple axioms. Pattanaik and Xu’s (1990), Recherches Economiques de Louvain 56, 383–390) characterization of the cardinality-based rule will be derived from our main result, and other new rules that stem from our general proposal are discussed and characterized in even simpler terms. In particular, we analyze restricted-cardinality based rules, where the set of “focal” elements is not given ex-ante; but brought out by the axioms. (shrink)

We present new axiomatic characterizations of the proportional Shapley value, a weighted TU-value with the worths of the singletons as weights. The presented characterizations are proportional counterparts to the famous characterizations of the Shapley value by Shapley and Young. We introduce two new axioms, called proportionality and player splitting, respectively. Each of them makes a main difference between the proportional Shapley value and the Shapley value. If the stand-alone worths are plausible weights, the proportional Shapley value is a convincing (...) alternative to the Shapley value, for example in cost allocation. Especially, the player splitting property, which states that players’ payoffs do not change if another player splits into two new players who have the same impact to the game as the original player, justifies the use of the proportional Shapley value in many economic situations. (shrink)

This article is an axiomatic approach to the problem of ranking game forms in terms of the predictability they offer to individuals. Two criteria are proposed and characterized, the CardMin and the CardMax. Both compare game forms on the basis of the number of distinct outcomes that can result from the choice of a CardMin (resp. CardMax) strategy. The CardMin (resp. CardMax) strategy is defined as a strategy leading to the smallest (resp. highest) number of different outcomes. In both (...) cases, the lower these numbers the better the game form. (shrink)

A new axiomatic characterization with a minimum of conditions for entropy as a function on the set of states in quantum mechanics is presented. Traditionally unspoken assumptions are unveiled and replaced by proven consequences of the axioms. First the Boltzmann–Planck formula is derived. Building on this formula, using the Law of Large Numbers—a basic theorem of probability theory—the von Neumann formula is deduced. Axioms used in older theories on the foundations are now derived facts.

A new class of values combining marginalistic and egalitarian principles is introduced for cooperative TU-games. It includes some modes of solidarity among the players by taking the collective contribution of some coalitions to the grand coalition into account. Relationships with other class of values such as the Egalitarian Shapley values and the Procedural values are discussed. We propose a strategic implementation of our class of values in subgame perfect Nash equilibrium. Two axiomatic characterizations are provided: one of the whole (...) class of values, and one of each of its extreme points. (shrink)

This article develops an axiomatic theory of induction that speaks to the recent debate on Bayesian orgulity. It shows the exact principles associated with the belief that data can corroborate universal laws. We identify two types of disbelief about induction: skepticism that the existence of universal laws of nature can be determined empirically, and skepticism that the true law of nature, if it exists, can be successfully identified. We formalize and characterize these two dispositions toward induction by introducing novel (...) axioms for subjective probabilities. We also relate these dispositions to the axiom of σ-additivity. (shrink)

While much of semantic theorizing is based on intuitions about logical phenomena associated with linguistic constructions—phenomena such as consistency and entailment—it is rare to see axiomatic treatments of linguistic fragments. Given a fragment interpreted in some class of formally specified models, it is often possible to ask for a characterization of the reasoning patterns validated by the class of models. Axiomatizations provide such a characterization, often in a perspicuous and efficient manner. In this paper, we highlight some (...) of the benefits of providing axiomatizations for the purpose of semantic theorizing. We illustrate some of these benefits using three examples from the study of modality. (shrink)

The first history of postwar mathematics, offering a new interpretation of the rise of abstraction and axiomatics in the twentieth century. Why did abstraction dominate American art, social science, and natural science in the mid-twentieth century? Why, despite opposition, did abstraction and theoretical knowledge flourish across a diverse set of intellectual pursuits during the Cold War? In recovering the centrality of abstraction across a range of modernist projects in the United States, Alma Steingart brings mathematics back into the conversation about (...) midcentury American intellectual thought. The expansion of mathematics in the aftermath of World War II, she demonstrates, was characterized by two opposing tendencies: research in pure mathematics became increasingly abstract and rarified, while research in applied mathematics and mathematical applications grew in prominence as new fields like operations research and game theory brought mathematical knowledge to bear on more domains of knowledge. Both were predicated on the same abstractionist conception of mathematics and were rooted in the same approach: modern axiomatics. For American mathematicians, the humanities and the sciences did not compete with one another, but instead were two complementary sides of the same epistemological commitment. Steingart further reveals how this mathematical epistemology influenced the sciences and humanities, particularly the postwar social sciences. As mathematics changed, so did the meaning of mathematization. Axiomatics focuses on American mathematicians during a transformative time, following a series of controversies among mathematicians about the nature of mathematics as a field of study and as a body of knowledge. The ensuing debates offer a window onto the postwar development of mathematics band Cold War epistemology writ large. As Steingart's history ably demonstrates, mathematics is the social activity in which styles of truth-here, abstraction-become synonymous with ways of knowing. (shrink)

Modal logic with counting is obtained from basic modal logic by adding cardinality comparison formulas of the form $ \#\varphi \succsim \#\psi $, stating that the cardinality of successors satisfying $ \varphi $ is larger than or equal to the cardinality of successors satisfying $ \psi $. It is different from graded modal logic where basic modal logic is extended with formulas of the form $ \Diamond _{k}\varphi $ stating that there are at least $ k$-many different successors satisfying $ (...) \varphi $. In this paper, we investigate the axiomatization of ML(#) with respect to different frame classes, such as image-finite frames and arbitrary frames. Drawing inspiration from existing works, we employ a similar proof strategy that uses the characterization of binary relations on finite Boolean algebras capable of representing generalized probability measures or finite (respectively arbitrary) cardinality measures. Our main result shows that any formula not provable in the Hilbert system can be refuted within a finite (respectively arbitrary) cardinality measure Kripke frame with a finite domain. We then transform this finite (respectively arbitrary) cardinality measure Kripke frame into a Kripke frame in the corresponding class, refuting the unprovable formula. (shrink)

We present a new axiomatization of the classical discounted expected utility model, which is primarily used as a decision model for consumption streams under risk. This new axiomatization characterizes discounted expected utility as a model that satisfies natural extensions of standard axioms as in the one-period case and two additional axioms. The first axiom is a weak form of time separability. It only requires that the choice between certain constant consumption streams and lotteries should be made by just taking into (...) account the time periods where the consumption is different. The second axiom, the time–probability equivalence, requires that risk and time preferences basically work in the same way. Moreover, we prove that preferences satisfying the natural extensions of the standard axioms as well as the first axiom can be represented in a simple form relying on three functions linked to the risk or time preferences in simple situations. Finally, we illustrate that several examples that are not fully time separable satisfy all our axioms except for the time–probability equivalence. (shrink)

We consider the problem of finding, in the ambit of modal logic, a minimal characterization for finite Kripke frames, i.e., a formula which, given a frame, axiomatizes its theory employing the lowest possible number of variables and implies the other axiomatizations. We show that every finite transitive frame admits a minimal characterization over K4, and that this result can not be extended to K.

In a voting context, when the preferences of voters are described by linear orderings over a finite set of alternatives, the Maximin rule orders the alternatives according to their minimal rank in the voters’ preferences. It is equivalent to the Fallback bargaining process described by Brams and Kilgour (Group Decision and Negotiation 10:287–316, 2001). This article proposes a characterization of the Maximin rule as a social welfare function (SWF) based upon five conditions: Neutrality, Duplication, Unanimity, Top Invariance, and Weak (...) Separability. In a similar way, we obtain a characterization for the Maximax SWF by using Bottom Invariance instead of Top Invariance. Then, these results are compared to the axiomatic characterizations of two famous scoring rules, the Plurality rule and the Antiplurality rule. (shrink)

Welfarism is the view that individual welfare is the only thing that matters. One important contribution of social choice theory has been to provide a precise formulation and axiomatic characterization of welfarism using Amartya Sen's framework of social welfare functionals. This paper is motivated by the observation that the standard formalization of welfarism is too restrictive, since a welfarist social planner need not be committed to maximizing a preference ordering or any other binary relation over alternatives. We therefore (...) provide a characterization of welfarism in a more general choice-functional setting and show that welfarism, so understood, carries no commitment to rationalizability. This characterization is compatible with welfare values having any structure whatsoever. It also sheds light on different formulations of anonymity, revealing only some of these to be fundamental requirements of impartiality. (shrink)

In this paper we characterize, classify and axiomatize all axiomatic extensions of the IMT3 logic. This logic is the axiomatic extension of the involutive monoidal t-norm logic given by ¬φ3 ∨ φ. For our purpose we study the lattice of all subvarieties of the class IMT3, which is the variety of IMTL-algebras given by the equation ¬(x 3) ∨ x ≈ ⊤, and it is the algebraic counterpart of IMT3 logic. Since every subvariety of IMT3 is generated by (...) their totally ordered members, we study the structure of all IMT3-chains in order to determine the lattice of all subvarieties of IMT3. Given a family of IMT3-chains the number of elements of the largest odd finite subalgebra in the family and the number of elements of the largest even finite subalgebra in the family turns out to be a complete classifier of the variety generated. We obtain a canonical set of generators and a finite equational axiomatization for each subvariety and, for each corresponding logic, a finite set of characteristic matrices and a finite set of axioms. (shrink)

In this paper we give a differential lifting principle which provides a general method to geometrically axiomatize the model companion (if it exists) of some theories of differential topological fields. The topological fields we consider here are in fact topological systems in the sense of van den Dries, and the lifting principle we develop is a generalization of the geometric axiomatization of the theory DCF₀ given by Pierce and Pillay. Moreover, it provides a geometric alternative to the axiomatizations obtained by (...) Tressl and Guzy/Point in separate papers where the authors also build general schemes of axioms for some model complete theories of differential fields. We first characterize the existentially closed models of a given theory of differential topological fields and then, under an additional hypothesis of largeness, we show how to modify this characterization to get a general scheme of first-order axioms for the model companion of any large theory of differential topological fields. We conclude with an application of this lifting principle proving that, in existentially closed models of a large theory of differential topological fields, the jet-spaces are dense in their ambient topological space. (shrink)

In this study we introduce two new properties, the Midpoint Outcome on a Linear Frontier (MOLF) and Balanced Focal Point (BFP) properties, to replace the Weak Pareto Optimality (WPO), Symmetry (SYM) and Independence of Equivalent Utility Representations (IEUR) properties in the axiomatic characterizations of the two most prominent solution concepts, namely the Nash and Kalai/Smorodinsky solutions, respectively.

This paper sketches the antilogism of Christine Ladd-Franklin and historical advancement about antilogism, mainly constructs an axiomatic system Atl based on first-order logic with equality and the wholly-exclusion and not-wholly-exclusion relations abstracted from the algebra of Ladd-Franklin, with soundness and completeness of Atl proved, providing a simple and convenient tool on syllogistic reasoning. Atl depicts the empty class and the whole class differently from normal set theories, e.g. ZFC, revealing another perspective on sets and set theories. Two series of (...) Dotterer and the theorem proved by Russinoff are re-characterized in antilogistic formulas corresponding to the square of opposition and twenty-four moods of syllogism. Then the restricted equivalence between two forms of antilogism and minimal inconsistency is built up, implying the internal connection between antilogisms and minimal inconsistency and leaving two related conjectures not proved. Besides, this paper provides a new explanation for the reason why contrariety, subcontrariety, and subalternation and the nine special moods require the non-empty assumption. (shrink)

Strictly proper scoring rules have been studied widely in statistical decision theory and recently in experimental economics because of their ability to encourage assessors to honestly provide their true subjective probabilities. In this article, we study the spherical scoring rule by analytically examining some of its properties and providing some new geometric interpretations for this rule. Moreover, we state a theorem which provides an axiomatic characterization for the spherical scoring rule. The objective of this analysis is to provide (...) a better understanding of one of the most commonly available scoring rules, which could aid decision makers in the selection of an appropriate tool for evaluating and assessing probabilistic forecasts. (shrink)

We study axiomatic extensions of the propositional constructive logic with strong negation having the disjunction property in terms of corresponding to them varieties of Nelson algebras. Any such varietyV is characterized by the property: (PQWC) ifA,B V, thenA×B is a homomorphic image of some well-connected algebra ofV.We prove:• each varietyV of Nelson algebras with PQWC lies in the fibre –1(W) for some varietyW of Heyting algebras having PQWC, • for any varietyW of Heyting algebras with PQWC the least and (...) the greatest varieties in –1(W) have PQWC, • there exist varietiesW of Heyting algebras having PQWC such that –1(W) contains infinitely many varieties (of Nelson algebras) with PQWC. (shrink)

This paper sketches the antilogism of Christine Ladd-Franklin and historical advancement about antilogism, mainly constructs an axiomatic system Atl based on first-order logic with equality and the wholly-exclusion and not-wholly-exclusion relations abstracted from the algebra of Ladd-Franklin, with soundness and completeness of Atl proved, providing a simple and convenient tool on syllogistic reasoning. Atl depicts the empty class and the whole class differently from normal set theories, e.g. ZFC, revealing another perspective on sets and set theories. Two series of (...) Dotterer and the theorem proved by Russinoff are re-characterized in antilogistic formulas corresponding to the square of opposition and twenty-four moods of syllogism. Then the restricted equivalence between two forms of antilogism and minimal inconsistency is built up, implying the internal connection between antilogisms and minimal inconsistency and leaving two related conjectures not proved. Besides, this paper provides a new explanation for the reason why contrariety, subcontrariety, and subalternation and the nine special moods require the non-empty assumption. (shrink)

Every artificial-intelligence research project needs a working definition of "intelligence", on which the deepest goals and assumptions of the research are based. In the project described in the following chapters, "intelligence" is defined as the capacity to adapt under insufficient knowledge and resources. Concretely, an intelligent system should be finite and open, and should work in real time. ;If these criteria are used in the design of a reasoning system, the result is NARS, a non-axiomatic reasoning system. ;NARS uses (...) a term-oriented formal language, characterized by the use of subject-predicate sentences. The language has an experience-grounded semantics, according to which the truth value of a judgment is determined by previous experience, and the meaning of a term is determined by its relations with other terms. Several different types of uncertainty, such as randomness, fuzziness, and ignorance, can be represented in the language in a single way. ;The inference rules of NARS are based on three inheritance relations between terms. With different combinations of premises, revision, deduction, induction, abduction, exemplification, comparison, and analogy can all be carried out in a uniform format, the major difference between these types of inference being that different functions are used to calculate the truth value of the conclusion from the truth values of the premises. ;Since it has insufficient space-time resources, the system needs to distribute them among its tasks very carefully, and to dynamically adjust the distribution as the situation changes. This leads to a "controlled concurrency" control mechanism, and a "bag-based" memory organization. ;A recent implementation of the NARS model, with examples, is discussed. The system has many interesting properties that are shared by human cognition, but are absent from conventional computational models of reasoning. ;This research sheds light on several notions in artificial intelligence and cognitive science, including symbol-grounding, induction, categorization, logic, and computation. These are discussed to show the implications of the new theory of intelligence. ;Finally, the major results of the research are summarized, a preliminary evaluation of the working definition of intelligence is given, and the limitations and future extensions of the research are discussed. (shrink)

This paper sketches the antilogism of Christine Ladd-Franklin and historical advancement about antilogism, mainly constructs an axiomatic system Atl based on first-order logic with equality and the wholly-exclusion and not-wholly-exclusion relations abstracted from the algebra of Ladd-Franklin, with soundness and completeness of Atl proved, providing a simple and convenient tool on syllogistic reasoning. Atl depicts the empty class and the whole class differently from normal set theories, e.g. ZFC, revealing another perspective on sets and set theories. Two series of (...) Dotterer and the theorem proved by Russinoff are re-characterized in antilogistic formulas corresponding to the square of opposition and twenty-four moods of syllogism. Then the restricted equivalence between two forms of antilogism and minimal inconsistency is built up, implying the internal connection between antilogisms and minimal inconsistency and leaving two related conjectures not proved. Besides, this paper provides a new explanation for the reason why contrariety, subcontrariety, and subalternation and the nine special moods require the non-empty assumption. (shrink)

In this paper we use the framework of generalized probabilistic theories to present two sets of basic assumptions, called axioms, for which we show that they lead to the Hilbert space formulation of quantum mechanics. The key results in this derivation are the co-ordinatization of generalized geometries and a theorem of Solér which characterizes Hilbert spaces among the orthomodular spaces. A generalized Wigner theorem is applied to reduce some of the assumptions of Solér’s theorem to the theory of symmetry in (...) quantum mechanics. Since this reduction is only partial we also point out the remaining open questions. (shrink)

The philosophy of science of Patrick Suppes is centered on two important notions that are part of the title of his recent book (Suppes 2002): Representation and Invariance. Representation is important because when we embrace a theory we implicitly choose a way to represent the phenomenon we are studying. Invariance is important because, since invariants are the only things that are constant in a theory, in a way they give the “objective” meaning of that theory. Every scientific theory gives a (...) representation of a class of structures and studies the invariant properties holding in that class of structures. In Suppes’ view, the best way to define this class of structures is via axiomatization. This is because a class of structures is given by a definition, and this same definition establishes which are the properties that a single structure must possess in order to belong to the class. These properties correspond to the axioms of a logical theory. In Suppes’ view, the best way to characterize a scientific structure is by giving a representation theorem for its models and singling out the invariants in the structure. Thus, we can say that the philosophy of science of Patrick Suppes consists in the application of the axiomatic method to scientific disciplines. What I want to argue in this paper is that this application of the axiomatic method is also at the basis of a new approach that is being increasingly applied to the study of computer science and information systems, namely the approach of formal ontologies. The main task of an ontology is that of making explicit the conceptual structure underlying a certain domain. By “making explicit the conceptual structure” we mean singling out the most basic entities populating the domain and writing axioms expressing the main properties of these primitives and the relations holding among them. So, in both cases, the axiomatization is the main tool used to characterize the object of inquiry, being this object scientific theories (in Suppes’ approach), or information systems (for formal ontologies). In the following section I will present the view of Patrick Suppes on the philosophy of science and the axiomatic method, in section 3 I will survey the theoretical issues underlying the work that is being done in formal ontologies and in section 4 I will draw a comparison of these two approaches and explore similarities and differences between them. (shrink)

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in [22] and [11]. We prove a characterization theorem for negatable formulas in independence logic and negatable sentences in dependence logic, and identify an interesting class of formulas that are negatable in independence logic. Dependence and independence atoms, first-order formulas belong to this class. We also demonstrate our extended system of independence logic by giving explicit (...) derivations for Armstrong's Axioms and the Geiger-Paz-Pearl axioms of dependence and independence atoms. (shrink)

The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di erent ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers and relation of (...) inequality) proposed by Witold Wilkosz, a Polish logician, philosopher and mathematician, in 1932. The axioms W are those of ordered sets without largest element, in which every non-empty set has a least element, and every set bounded from above has a greatest element. We show that P and W are equivalent and also that the systems of arithmetic based on W or on P, are categorical and consistent. There follows a set of intuitive axioms PI of integers arithmetic, modelled on P and proposed by B. Iwanuś, as well as a set of axioms WI of this arithmetic, modelled on the W axioms, PI and WI being also equivalent, categorical and consistent. We also discuss the problem of independence of sets of axioms, which were dealt with earlier. (shrink)

We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six (...) classes of spaces considered in the paper are pairwise distinct, while the C-logics of some of them coincide. (shrink)

The aim of the paper is this: Instead of presenting a provisional and necessarily insufficient characterization of what mathematical physics is, I will ask the reader to take it just as that, what he or she thinks or believes it is, yet to be prepared to revise his opinion in the light of what I am going to tell. Because this is precisely, what I intend to do. I will challenge some of the received or standard views about mathematical (...) physics and replace them by a more sophisticated picture, which takes into account the methodological and philosophical roots of mathematical physics in Göttingen. (shrink)

A situation, in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (point-valued) solution for TU-games assigns a payoff distribution to every TU-game. In this article we discuss a class of equal surplus sharing solutions consisting of all convex combinations of the CIS-value, the ENSC-value and the equal division solution. We provide several characterizations of this class of solutions on variable and fixed (...) player set. Specifications of several properties characterize specific solutions in this class. (shrink)

Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...) Thesis, as Gödel and others suggested may be possible. In a similar way, but with a different set of basic operations, one can prove Turing's Thesis, characterizing the effective string functions, and--in particular--the effectively-computable functions on string representations of numbers. (shrink)

This article illustrates how axiomatic social choice theory can be used in the evaluation of measures of group fitness for a biological hierarchy, thereby contributing to the dialogue between the philosophy of biology and social choice theory. It provides an axiomatic characterization of the ordering underlying the MichodSolariNedelcu index of group fitness for a multicellular organism. The MVSHN index has been used to analyse the germ-soma specialization and the fitness decoupling between the cell and organism levels that (...) takes place during the evolutionary transition to multicellularity. It is argued that some of the axioms satisfied by the MVSHN group fitness ordering are not appropriate for all stages in this transition. (shrink)

The aim of this paper is technically to study Belnap's four-valued sentential logic . First, we obtain a Gentzen-style axiomatization of this logic that contains no structural rules while all they are still admissible in the Gentzen system what is proved with using some algebraic tools. Further, the mentioned logic is proved to be the least closure operator on the set of {Λ, V, ⌝}-formulas satisfying Tarski's conditions for classical conjunction and disjunction together with De Morgan's laws for negation. It (...) is also proved that Belnap's logic is the only sentential logic satisfying the above-mentioned conditions together with Anderson-Belnap's Variable-Sharing Property. Finally, we obtain a finite Hilbert-style axiomatization of this logic. As a consequence, we obtain a finite Hilbert-style axiomatization of Priest's logic of paradox. (shrink)

We present an axiomatization of a problem in commonsense reasoning, characterizing the proper procedure for cracking an egg and transferring its contents to a bowl. The axiomatization is mid-sized, larger than toy problems such as the Yale Shooting Problem or the Suitcase Problem, but much smaller than the comprehensive axiomatizations associated with CYC and HPKB. This size of axiomatization permits the development of non-trivial, reusable core theories of commonsense reasoning, acts as a testbed for existing theories of commonsense reasoning, and (...) encourages the discovery of new problems in commonsense reasoning.We present portions of core theories of containment, falling, and pouring, integrated into Shanahan's circumscriptive event calculus, and show how these can serve as the basis of an axiomatization that partly characterizes egg cracking. We discuss several commonsense reasoning problems encountered during this research, such as the Initial Specification Problem (a relative of the frame problem that occurs in theories in which fluents can trigger actions), and the Unobtainable State Problem (the problem of determining whether or not a theorem stating that one cannot get from one state to another is meaningful). (shrink)

A situation, in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A (point-valued) solution for TU-games assigns a payoff distribution to every TU-game. In this article we discuss a class of equal surplus sharing solutions consisting of all convex combinations of the CIS-value, the ENSC-value and the equal division solution. We provide several characterizations of this class of solutions on variable and fixed (...) player set. Specifications of several properties characterize specific solutions in this class. (shrink)

Maxmin Expected Utility was first axiomatized by Gilboa and Schmeidler in an Anscombe–Aumann setup Anscombe and Aumann which includes exogenous probabilities. The model was later axiomatized in a purely subjective setup, where no exogenous probabilities are assumed. The purpose of this note is to show that in all these axiomatizations, the only assumptions that are needed are the basic ones that are used to extract a cardinal utility function, together with the two typical Maxmin assumptions, Uncertainty Aversion and Certainty Independence, (...) applied only to 0.5:0.5 mixtures. For the purely subjective characterizations, this means that assumptions involving an unbounded number of variables can be replaced with assumptions that involve only a finite number thereof. (shrink)

The present article covers the first part of our constructive-axiomatic approach to general spacetime, guided by Ludwig's conception of an axiomatic base. The leading idea of axiomatization is a generalized version of the equivalence principle—the principle of approximative reproducibility. As fundamental concepts we use processes and reproductions of processes. On the universe of processes the point space of events is founded which carries the familiar properties of spacetime topology. A general contact relation for reproductions is the key structure (...) to build up a group of tangential germs (pre-jets). Finally, using Yamabe's characterization we obtain the Lie structure. (shrink)