Set Of Axioms Research Articles

An Application of Quantum Logic to Experimental Behavioral Science

In 1933, Kolmogorov synthesized the basic concepts of probability that were in general use at the time into concepts and deductions from a simple set of axioms that said probability was a σ-additive function from a boolean algebra of events into [0, 1]. In 1932, von Neumann realized that the use of probability in quantum mechanics required a different concept that he formulated as a σ-additive function from the closed subspaces of a Hilbert space onto [0,1]. In 1935, Birkhoff & von Neumann replaced Hilbert space with an algebraic generalization. Today, a slight modification of the Birkhoff-von Neumann generalization is called “quantum logic”. A central problem in the philosophy of probability is the justification of the definition of probability used in a given application. This is usually done by arguing for the rationality of that approach to the situation under consideration. A version of the Dutch book argument given by de Finetti in 1972 is often used to justify the Kolmogorov theory, especially in scientific applications. As von Neumann in 1955 noted, and his criticisms still hold, there is no acceptable foundation for quantum logic. While it is not argued here that a rational approach has been carried out for quantum physics, it is argued that (1) for many important situations found in behavioral science that quantum probability theory is a reasonable choice, and (2) that it has an arguably rational foundation to certain areas of behavioral science, for example, the behavioral paradigm of Between Subjects experiments.

On the (In)Dependence of the Peano Axioms for Natural Numbers

We investigate two notions of independence—(usual) independence and complete independence—applied to the Peano axioms for the sequence of natural numbers. We review the results that, although they are independent, the Peano axioms are not completely independent. The standard proof that the Peano axioms are not completely independent is algebraic, in the sense that it makes essential reference to the relationship between several mathematical structures that satisfy, or do not satisfy, these axioms. We then present an alternative logical proof, which makes no essential references to the relationship between mathematical structures. There is a completely independent set of axioms for the sequence of natural numbers, but it is based on primitives different from those originally adopted by Peano. Therefore, we present a new completely independent set of axioms based on the same set of primitives as the one originally adopted by Peano.

Recombinable Game Mechanics for Automated Design Support

Systems that provide automated game-design support — whether fully automated game generators, or tools to assist human designers — must be able to maintain a representation of a game design and add or remove game mechanics to support incrementally modifying the game. The system should then be able to reason about the design to support the designer. For example, it might point out that the set of mechanics makes the game unwinnable; or that there's only one complex possible way to beat the game; or that some room is impossible to get to. In addition, the same representation should be actually playable as a game. Existing game representations encode a fairly narrow range of games, most commonly symmetric board games; these representations are also difficult to extend or revise. We propose an architecture based on the event calculus, a logical representation designed for reasoning about time in an elaboration-tolerant way, meaning that designs can be changed by adding or removing sets of axioms rather than modifying brittle hard-coded representations. The resulting game design is a declarative specification in formal logic, so can be critiqued by making queries that are answered through logical inference. Since it specifies the game's simulation rules, it may be executed by logical inference as well; if symbols specifying input and graphical representation are appropriately mapped to input devices and a graphical display, the same declarative representation can be executed as a fully interactive, graphical game. We describe how to organize a library of game-design mechanics using this event-calculus framework, and describe a simple tile-based game, showing how it can be easily modified, critiqued and debugged, and played.

A new axiomatic approach to the impartial nomination problem

In this paper we introduce a new set of axioms that characterize uniform random dictatorship (URD) as a randomized impartial nomination rule. Unlike earlier work we use a variable population model which allows us to employ axioms that reflect consistency and proportionality–axioms that ensure that the rule behaves well with respect to the combinatorial structure of the nomination profile. Earlier work characterizing URD employed strong symmetry axioms and so it is surprising that our axioms characterize the same rule.

SPARQL Query Containment Under SHI Axioms

SPARQL query containment under schema axioms is the problem of determining whether, for any RDF graph satisfying a given set of schema axioms, the answers to a query are contained in the answers of another query. This problem has major applications for verification and optimization of queries. In order to solve it, we rely on the mu-calculus. Firstly, we provide a mapping from RDF graphs into transition systems. Secondly, SPARQL queries and RDFS and SHI axioms are encoded into mu-calculus formulas. This allows us to reduce query containment and equivalence to satisfiability in the mu-calculus. Finally, we prove a double exponential upper bound for containment under SHI schema axioms.

Effective randomness for continuous measures

We investigate which infinite binary sequences (reals) are effectively random with respect to some continuous (i.e., non-atomic) probability measure. We prove that for every n n , all but countably many reals are n n -random for such a measure, where n n indicates the arithmetical complexity of the Martin-Löf tests allowed. The proof rests upon an application of Borel determinacy. Therefore, the proof presupposes the existence of infinitely many iterates of the power set of the natural numbers. In the second part of the paper we present a metamathematical analysis showing that this assumption is indeed necessary. More precisely, there exists a computable function G G such that, for any n n , the statement “All but countably many reals are G ( n ) G(n) -random with respect to a continuous probability measure” cannot be proved in Z F C n − \mathsf {ZFC}^-_n . Here Z F C n − \mathsf {ZFC}^-_n stands for Zermelo-Fraenkel set theory with the Axiom of Choice, where the Power Set Axiom is replaced by the existence of n n -many iterates of the power set of the natural numbers. The proof of the latter fact rests on a very general obstruction to randomness, namely the presence of an internal definability structure.

INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY

AbstractBy a classical theorem of Harvey Friedman (1973), every countable nonstandard model $\mathcal {M}$ of a sufficiently strong fragment of ZF has a proper rank-initial self-embedding j, i.e., j is a self-embedding of $\mathcal {M}$ such that $j[\mathcal {M}]\subsetneq \mathcal {M}$ , and the ordinal rank of each member of $j[\mathcal {M}]$ is less than the ordinal rank of each element of $\mathcal {M}\setminus j[\mathcal {M}]$ . Here, we investigate the larger family of proper initial-embeddings j of models $\mathcal {M}$ of fragments of set theory, where the image of j is a transitive submodel of $\mathcal {M}$ . Our results include the following three theorems. In what follows, $\mathrm {ZF}^-$ is $\mathrm {ZF}$ without the power set axiom; $\mathrm {WO}$ is the axiom stating that every set can be well-ordered; $\mathrm {WF}(\mathcal {M})$ is the well-founded part of $\mathcal {M}$ ; and $\Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $ is the full scheme of dependent choice of length $\alpha $ .Theorem A.There is an $\omega $ -standard countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^-+\mathrm {WO}$ that carries no initial self-embedding $j:\mathcal {M} \longrightarrow \mathcal {M}$ other than the identity embedding.Theorem B.Every countable $\omega $ -nonstandard model $\mathcal {M}$ of $\ \mathrm {ZF}$ is isomorphic to a transitive submodel of the hereditarily countable sets of its own constructible universe $L^{\mathcal {M}}$ .Theorem C.The following three conditions are equivalent for a countable nonstandard model $\mathcal {M}$ of $\mathrm {ZF}^{-}+\mathrm {WO}+\forall \alpha \ \Pi ^1_\infty \text{-}\mathrm {DC}_\alpha $ . (I)There is a cardinal in $\mathcal {M}$ that is a strict upper bound for the cardinality of each member of $\mathrm {WF}(\mathcal {M})$ .(II) $\mathrm {WF}(\mathcal {M})$ satisfies the powerset axiom.(III)For all $n \in \omega $ and for all $b \in M$ , there exists a proper initial self-embedding $j: \mathcal {M} \longrightarrow \mathcal {M}$ such that $b \in \mathrm {rng}(j)$ and $j[\mathcal {M}] \prec _n \mathcal {M}$ .

Fuzzy group identification problems

The Group Identification Problem (“Who is a J?”) introduced by Kasher and Rubinstein [14] assumes a finite class of agents, each one with an opinion about the membership to a group J of the members of the society, consisting in a function that indicates for each agent, including herself, the degree of membership to J. The problem is that of aggregating those functions, satisfying different sets of axioms and characterizing different aggregators. The literature has already considered fuzzy versions of this problem. In this paper we consider alternative fuzzy presentations of the axiomatic of the original problem. While some results are analogous to those of the original crisp model, we show that our fuzzy version is able to overcome some of the main impossibility results of Kasher and Rubinstein.

Automating Induction by Reflection

Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires an infinite number of axioms, which is not a feasible input to a computer-aided theorem prover requiring a finite input. Mathematical practice is to specify these infinite sets of axioms as axiom schemes. Unfortunately these schematic definitions cannot be formalized in first-order logic, and therefore not supported as inputs for first-order theorem provers. In this work we introduce a new method, inspired by the field of axiomatic theories of truth, that allows to express schematic inductive definitions, in the standard syntax of multi-sorted first-order logic. Further we test the practical feasibility of the method with state-of-the-art theorem provers, comparing it to solvers' native techniques for handling induction.

Distinguishing L-functions by joint universality

In this note, we present results for distinguishing L-functions by their multisets of zeros and unique factorizations in an axiomatic setting; our tools stem from universality theory.

L-Fuzzy Rough Approximation Operators Based on Co-Implication and Their (Single) Axiomatic Characterizations

For L a complete co-residuated lattice and R an L-fuzzy relation, an L-fuzzy upper approximation operator based on co-implication adjoint with L is constructed and discussed. It is proved that, when L is regular, the new approximation operator is the dual operator of the Qiao–Hu L-fuzzy lower approximation operator defined in 2018. Then, the new approximation operator is characterized by using an axiom set (in particular, by single axiom). Furthermore, the L-fuzzy upper approximation operators generated by serial, symmetric, reflexive, mediate, transitive, and Euclidean L-fuzzy relations and their compositions are characterize through axiom set (single axiom), respectively.

A Finitely Axiomatized Non-Classical First-Order Theory Incorporating Category Theory and Axiomatic Set Theory

It is well known that Zermelo-Fraenkel Set Theory (ZF), despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the Löwenheim–Skolem theorem. This paper presents the axioms one has to accept to get rid of these two features. For that matter, some twenty axioms are formulated in a non-classical first-order language with countably many constants: to this collection of axioms is associated a universe of discourse consisting of a class of objects, each of which is a set, and a class of arrows, each of which is a function. The axioms of ZF are derived from this finite axiom schema, and it is shown that it does not have a countable model—if it has a model at all, that is. Furthermore, the axioms of category theory are proven to hold: the present universe may therefore serve as an ontological basis for category theory. However, it has not been investigated whether any of the soundness and completeness properties hold for the present theory: the inevitable conclusion is therefore that only further research can establish whether the present results indeed constitute an advancement in the foundations of mathematics.

Coronavirus and sports leagues: obtaining a fair ranking when the season cannot resume

Many sports leagues are played in a tightly scheduled round-robin format, leaving a limited time window to postpone matches. If the season cannot resume due to an external shock such as the coronavirus pandemic in 2020, the ranking of the teams becomes non-trivial: it is necessary to account for schedule imbalances and possibly for the different number of matches played. First in the literature, we identify a set of desired axioms for ranking in these incomplete tournaments. It is verified that the generalized row sum, a parametric family of scoring rules, satisfies all of them. In particular, the well-established least-squares method maximizes the influence of the strength of opponents on the ranking. Our approach is applied for six major premier European soccer competitions, where the rankings are found to be robust concerning the weight of adjustment for the strength of the opponents. Some methodologically simpler alternative policies are also discussed.

Descriptional Complexity of Semi-Simple Splicing Systems

Splicing systems are generative mechanisms introduced by Tom Head in 1987 to model the biological process of DNA recombination. The computational engine of a splicing system is the “splicing operation”, a cut-and-paste binary string operation defined by a set of “splicing rules”, quadruples [Formula: see text] where [Formula: see text] are words over an alphabet [Formula: see text]. For two strings [Formula: see text] and [Formula: see text], applying the splicing rule [Formula: see text] produces the string [Formula: see text]. In this paper we focus on a particular type of splicing systems, called [Formula: see text] semi-simple splicing systems, [Formula: see text] and [Formula: see text], wherein all splicing rules [Formula: see text] have the property that the two strings in positions [Formula: see text] and [Formula: see text] in [Formula: see text] are singleton letters, while the other two strings are empty. The language generated by such a system consists of the set of words that are obtained starting from an initial set called “axiom set”, by iteratively applying the splicing rules to strings in the axiom set as well as to intermediately produced strings. We consider semi-simple splicing systems where the axiom set is a regular language, and investigate the descriptional complexity of such systems in terms of the size of the minimal deterministic finite automata that recognize the languages they generate.

Revealed preferences of individual players in sequential games

This paper studies rational choice behavior of a player in sequential games of perfect and complete information without an assumption that the other players who join the same games are rational. The model of individually rational choice is defined through a decomposition of the behavioral norm assumed in the subgame perfect equilibria, and we propose a set of axioms on collective choice behavior that characterize the individual rationality obtained as such. As the choice of subgame perfect equilibrium paths is a special case where all players involved in the choice environment are each individually rational, the paper offers testable characterizations of both individual rationality and collective rationality in sequential games.

Safety Ontology Modeling and Verification on MIS of Ship-Building and Repairing Enterprise

Shipbuilding and repairing enterprise has the characteristics of many hazards and accidents. Therefore, the safety management ability of shipbuilding and repairing MIS (management information system) must be effectively guaranteed. The verification on safety management is the necessary measure to ensure and improve the safety management ability of MIS. Safety verification can not only increase the safety of MIS, but also make early warning of potential risks in management to avoid the accidents. Based on the authoritative standards in the field of safety in shipbuilding and repairing enterprise, this paper applied modeling and verification method based on ontology to safety verification of MIS, extracted the concepts and associations from related safety standards to construct axiom set to support safety verification on MIS of shipbuilding and repairing enterprise. Then, this paper developed the corresponding safety ontology modeling and verification tool-SOMVT. By the application and comparison of two examples, this paper effectively verified the safety of MIS to prove the modeling method and the SOMVT can improve the safety of MIS in a much more effective and stable way to traditional manual analysis.

Additively-separable and rank-discounted variable-population social welfare functions: A characterization

Economic policy evaluations require social welfare functions for variable-size populations. Two important candidates are critical-level generalized utilitarianism (CLGU) and rank-discounted critical-level generalized utilitarianism, which was recently characterized by Asheim and Zuber (2014) (AZ). AZ introduce a novel axiom, existence of egalitarian equivalence (EEE). First, we show that, under some uncontroversial criteria for a plausible social welfare relation, EEE suffices to rule out the Repugnant Conclusion of population ethics (without AZ’s other novel axioms). Second, we provide a new characterization of CLGU: AZ’s set of axioms is equivalent to CLGU when EEE is replaced by the axiom same-number independence.

XV—On Consistency and Existence in Mathematics

AbstractThis paper engages the question ‘Does the consistency of a set of axioms entail the existence of a model in which they are satisfied?’ within the frame of the Frege-Hilbert controversy. The question is related historically to the formulation, proof and reception of Gödel’s Completeness Theorem. Tools from mathematical logic are then used to argue that there are precise senses in which Frege was correct to maintain that demonstrating consistency is as difficult as it can be, but also in which Hilbert was correct to maintain that demonstrating existence given consistency is as easy as it can be.

Covariant Homogeneous Nets of Standard Subspaces

Rindler wedges are fundamental localization regions in AQFT. They are determined by the one-parameter group of boost symmetries fixing the wedge. The algebraic canonical construction of the free field provided by Brunetti–Guido–Longo (BGL) arises from the wedge-boost identification, the BW property and the PCT Theorem. In this paper we generalize this picture in the following way. Firstly, given a mathbb Z_2-graded Lie group we define a (twisted-)local poset of abstract wedge regions. We classify (semisimple) Lie algebras supporting abstract wedges and study special wedge configurations. This allows us to exhibit an analog of the Haag–Kastler one-particle net axioms for such general Lie groups without referring to any specific spacetime. This set of axioms supports a first quantization net obtained by generalizing the BGL construction. The construction is possible for a large family of Lie groups and provides several new models. We further comment on orthogonal wedges and extension of symmetries.

Entanglement bootstrap approach for gapped domain walls

We develop a theory of gapped domain wall between topologically ordered systems in two spatial dimensions. We find a new type of superselection sector -- referred to as the parton sector -- that subdivides the known superselection sectors localized on gapped domain walls. Moreover, we introduce and study the properties of composite superselection sectors that are made out of the parton sectors. We explain a systematic method to define these sectors, their fusion spaces, and their fusion rules, by deriving nontrivial identities relating their quantum dimensions and fusion multiplicities. We propose a set of axioms regarding the ground state entanglement entropy of systems that can host gapped domain walls, generalizing the bulk axioms proposed in [B. Shi, K. Kato, and I. H. Kim, Ann. Phys. 418, 168164 (2020)]. Similar to our analysis in the bulk, we derive our main results by examining the self-consistency relations of an object called information convex set. As an application, we define an analog of topological entanglement entropy for gapped domain walls and derive its exact expression.