Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s (...) type-restrictions are unjustifiable, the type-restrictions imposed by STT are justified by a Fregean semantics. What is more, this Fregean semantics provides us with a principled way to resist Linnebo and Rayo’s Semantic Argument for CTT. We end by examining an alternative approach to cumulative types due to Florio and Jones; we argue that their theory is best seen as a misleadingly formulated version of STT. (shrink)

The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness theorem for K∞α is proved by the method of reduction trees, and it is shown that every model of K∞α is equivalent to a cumulative hierarchy of sets. This is used to show that several axiomatic first-order set theories can be interpreted in K∞α, for suitable α.

Original and cumulative prospect theory differ in the composition rule used to combine the probability weighting function and the value function. We test the predictive power of these composition rules by performing a novel out-of-sample prediction test. We apply estimates of prospect theory’s weighting and value function obtained from two-outcome cash equivalents, a domain where original and cumulative prospect theory coincide, to three-outcome cash equivalents, a domain where the composition rules of the two theories differ. (...) Although both forms of prospect theory predict three-outcome cash equivalents very well, at the aggregate level, we find small but systematic under-prediction of cash equivalents for cumulative prospect theory and small but systematic over-prediction of cash equivalents for original prospect theory. We also observe substantial heterogeneity across subjects and types of gambles, some of which is accounted for by differences in the curvature and elevation of the weighting function across individuals. We also find differences in prediction related to whether the worst outcome is zero or non-zero. (shrink)

In this paper I examine the nature of Russell's ramified type theory resolution of paradoxes. In particular, I consider the effect of construing the types in Church's cumulative sense, that is, the range of a variable of a given type includes the range of every variable of directly lower type. Contrary to what seems to be generally assumed, I show that the decision to make the levels cumulative and allow this to be reflected in (...) the semantics is not neutral with respect to the solution of the paradoxes. I introduce a distinction between syntactical and semantical cumulativeness. It turns out that noncumulative type theories (in either sense) are equally capable of dealing with the paradoxes. Furthermore, whether cumulativeness is appropriate appears to be context dependent. (shrink)

This paper investigates the connection between two recent trends in philosophy: higher-orderism and conceptual engineering. Higher-orderists use higher-order quantifiers (in particular quantifiers binding variables that occupy the syntactic positions of predicates) to express certain key metaphysical doctrines, such as the claim that there are properties. I argue that, on a natural construal, the higher-orderist approach involves an engineering project concerning, among others, the concept of existence. I distinguish between a modest construal of this project, on which it aims at engineering (...) higher-order analogues of the familiar notion of first-order existence, and an ambitious construal, on which it additionally aims at engineering a broadened notion of existence that subsumes first-order and higher-order existence. After identifying a substantial problem for the ambitious project, I investigate a possible response which is based on adopting a cumulative type theory as the background higher-order logic. While effective against the problem at hand, this strategy turns out to undermine a major reason to embrace higher-orderism in the first place, namely the idea that higher-orderism dissolves a range of otherwise intractable debates in metaphysics. Higher-orderists are therefore best advised to pursue their engineering project on the modest variant and against the background of standard type theory. (shrink)

Many critics of dual-process models have mistaken long lists of descriptive terms in the literature for a full-blown theory of necessarily co-occurring properties. These critiques have distracted attention from the cumulative progress being made in identifying the much smaller set of properties that truly do define Type 1 and Type 2 processing. Our view of the literature is that autonomous processing is the defining feature of Type 1 processing. Even more convincing is the converging evidence (...) that the key feature of Type 2 processing is the ability to sustain the decoupling of secondary representations. The latter is a foundational cognitive requirement for hypothetical thinking. (shrink)

What is absolutely unrestricted quantification? We distinguish two theoretical roles and identify two conceptions of absolute generality: maximally strong generality and maximally inclusive generality. We also distinguish two corresponding kinds of absolute domain. A maximally strong domain contains every potential counterexample to a generalisation. A maximally inclusive domain is such that no domain extends it. We argue that both conceptions of absolute generality are legitimate and investigate the relations between them. Although these conceptions coincide in standard settings, we show how (...) they diverge under more complex assumptions about the structure of meaningful predication, such as cumulative type theory. We conclude by arguing that maximally strong generality is the more theoretically valuable conception. (shrink)

I formulate the Zermelo-Russell paradox for naive set theory. A sketch is given of Zermelo’s solution to the paradox: the cumulative type structure. A careful analysis of the set formation process shows a missing component in this solution: the necessity of an assumed imaginary jump out of an infinite universe. Thus a set is formed by a suitable combination of concrete and imaginary operations all of which can be made or assumed by a Turing machine. Some consequences (...) are drawn from this improved analysis of the concept of set, for the theory of sets and for the philosophy and foundations of mathematics. (shrink)

For each ordinal α it is given a model for Skala's set theory using the well-known cumulative type hierarchy.

This book develops a unified theory of moral progress. The author argues that there are mechanisms in place that consistently drive societies towards moral improvement and that a sophisticated, naturalistically respectable form of teleology can be defended. The book's main aim is to flesh out the process of moral progress in more detail, and to show how, when the right mechanisms and institutions of moral progress are matched together, they create pressure for the desired types of moral gains to (...) manifest. The first part of the book deals with two issues: the conceptual one about what moral progress is, and the broadly empirical one whether it is possible. It shows that cultural evolution successfully explains the origins of modern forms of morally welcome change. The second part argues that there is logical space for a moderate, scientifically credible form of teleology, and that the converse case for moral decline is weak. It addresses the types, drivers and institutions of moral progress that allow for the storage, transmission and cumulative improvement of our normative infrastructure over time. Finally, the third part demonstrates why moral progress cannot be accounted for in metaethically realist terms. Moral Teleology will be of interest to researchers and advanced students working in ethics, moral epistemology and moral psychology. (shrink)

Almost all set theorists pay at least lip service to Cantor’s definition of a set as a collection of many things into one whole; but empty and singleton sets do not fit with it. Adapting Dana Scott’s axiomatization of the cumulative theory of types, we present a ‘Cantorian’ system which excludes these anomalous sets. We investigate the consequences of their omission, examining their claim to a place on grounds of convenience, and asking whether their absence is an obstacle (...) to the theory’s ability to represent ordered pairs or to support the arithmetization of analysis or the development of the theory of cardinals and ordinals. (shrink)

My dissertation studies three problems that threaten our functional explanatory practices. The first study, The Normativity Problem and Theories of Biological Function, attempts to explain how it is that biological tokens can perform their functions better or worse, and can retain their functions even when not currently performing them. Etiological theories can try to account for the normativity of functions by cumulative selection or by their contributions to fitness. I argue that neither strategy succeeds. Systemic theories hold that functions (...) are the causal contributions of systemic components to the overall capacities of their containing systems. At first glance, systemic theories do not explain the normativity of functions either. I argue that adding a feedback condition to systemic theories can account for the normativity of functions. The second study, The Malfunction Problem and the Functional Individuation of Biological Traits, attempts to dissolve an apparent paradox about how, if biological traits are functionally individuated, it is possible for an organism to possess a biological trait that malfunctions. The malfunction problem articulates the apparent paradox: A ‘malfunctioning’ trait token seems to no longer belong to its functional type and hence cannot malfunction. I show that distinguishing between the functional type that a token instantiates and the current performance of its function dissolves the paradox. The third study, The Necessitation Problem and the Causal Relevance of Functional Properties, attempts to address a vacuity worry about causal explanation that seems to arise when a property referred to by a causal explanation is individuated by its very effects. Since functional properties are individuated by their functions, and functions are effects, it is hard to see how the ascription of functional properties can play an explanatory role. For the relevant explanations seem to be vacuous: the property that purportedly explains the effect is just the property of having that very effect. I argue that causally relevant functional properties are individuated by historical effects, whereas the effects that they causally explain are current. Since the effects individuating causally relevant properties are distinct from the effects that are causally explained, the vacuity worry does not arise. (shrink)

This study extends experimental tests of (cumulative) prospect theory (PT) over prospects with more than three outcomes and tests second-order stochastic dominance principles (Levy and Levy, Management Science 48:1334–1349, 2002; Baucells and Heukamp, Management Science 52:1409–1423, 2006). It considers choice behavior of people facing prospects of three different types: gain prospects (losing is not possible), loss prospects (gaining is not possible), and mixed prospects (both gaining and losing are possible). The data supports the distinction of risk behavior into (...) these three categories of prospects, Further, probability weighting and diminishing sensitivity of utility as predicted by PT are observed. Loss aversion is, however, less pronounced, except for choices where one prospect is degenerate. The data suggests that the probability of losing may be relevant for loss aversion. (shrink)

The ancient problems of bankruptcy, contested garment, and rights arbitration have generated many studies, debates, and controversy. The objective of this paper is to show that the Shapley value from game theory, measuring the power of each player in a game, may be consistently applied for getting the general one-step solution of all these three problems viewed as -person games. The decision making is based on the same tool, namely the game theory logic based on the use of (...) the Shapley value, but the specific games involved are slightly different in each problem. The kind of claims of the players, the relationship between the given claims and the given resources available, and the particular way of calculating the generalized characteristic function of the game determine the specific type of game which has to be solved in each of the three ancient problems mentioned. The iterative use of the Shapley value may also justify the well-known Aumann-Maschler step-by-step procedure for solving the bankruptcy problem. (shrink)

This volume forms part of the series of the Princeton Studies in Humanistic Scholarship in America, under the general editorship of Richard Schlatter. Uitti's exposition of theories of language and literature from ancient Greece to contemporary America is oriented toward the proposal for a coordination of studies of language and literature in a sort of modern trivium of grammar, rhetoric, and dialectic. In the first part of the book, the author concentrates on Platonic "symbolic" and Aristotelian "analytic" ideas about language, (...) and then traces these two currents throughout the Middle Ages, paying special attention to Priscian, Anselm, Abelard, Petrus Hispanus, Dante, and the grammatica speculativa. He then brings the survey up to modern times, examining Descartes, the Port-Royal grammar, Du Marsais, Diderot, and Rousseau. Condillac and Coleridge are treated in detail as representing two modern theories of expression/communication, the one analytic and linguistic, the other synthetic and aesthetic. The second part of this work deals with a history of both linguistics and of American literary criticism, stressing I. A. Richards' descriptivism, new critic theories of metaphor and irony, and Wellek and Warren's Theory of Literature. Uitti singles out Roman Jakobson as being most prophetic in outlining future cooperation of linguistics and literary theory, and in this light analyzes various papers in Style and Language, in particular C. F. Voegelin's and Michel Riffaterre's. This survey of the contemporary American scene points to the fact that ours is a sign-oriented culture, and that recent studies in linguistics and in literary criticism of the poetics type have been sharing the same philosophical assumptions. The author thinks that language and literature studies would function best in the future as disciplines united in the broad matrix of cultural process, and using linguistic categories. He thus shares an oft-expressed hope for a cumulative literary "science," in which individual studies are oriented toward the broader construct. This book is addressed to the nonspecialist, but the expert will profit from Uitti's generous style which opens up new vistas on every page.--C. M. R. (shrink)

In Rawls’ influential social contract approach to distributive justice, the fair income distribution is the one that an individual would choose behind a veil of ignorance. Harsanyi treated this situation as a decision under risk and arrived at utilitarianism using expected utility theory. This paper investigates the implications of applying cumulative prospect theory instead, which better describes behavior under risk. I find that the specific type of inequality in bottom-heavy right-skewed income distributions, which includes the log-normal (...) income distribution, could be perceived as desirable. This optimal inequality result contrasts the implications of other social welfare criteria. (shrink)

The present paper is concerned with a ramified type theory (cf. (Lorenzen 1955), (Russell), (Schütte), (Weyl), e.g.,) in a cumulative version. §0 deals with reasoning in first order languages. is introduced as a first order set.

Higher-order logic, with its type-theoretic apparatus known as the simple theory of types (STT), has increasingly come to be employed in theorizing about properties, relations, and states of affairs—or ‘intensional entities’ for short. This paper argues against this employment of STT and offers an alternative: ordinal type theory (OTT). Very roughly, STT and OTT can be regarded as complementary simplifications of the ‘ramified theory of types’ outlined in the Introduction to Principia Mathematica (on a realist (...) reading). While STT, understood as a theory of intensional entities, retains the Fregean division of properties and relations into a multiplicity of categories according to their adicities and ‘input types’ and discards the division of intensional entities into different ‘orders’, OTT takes the opposite approach: it retains the hierarchy of orders (though with some modifications) and discards the categorisation of properties and relations according to their adicities and input types. In contrast to STT, this latter approach avoids intensional counterparts of the Epimenides and related paradoxes. Fundamental intensional entities lie at the base of the proposed hierarchy and are also given a prominent part to play in the individuation of non-fundamental intensional entities. (shrink)

Recent debates in metaphysics have highlighted the significance of type theories, such as Simple Type Theory (STT), for our philosophical analysis. In this chapter, I present the salient features of a constructive type theory in the style of Martin-Löf, termed CTT. My principal aim is to convey the flavour of this rich, flexible and sophisticated theory and compare it with STT. I especially focus on the forms of quantification which are available in CTT. A (...) further aim is to argue that a comparison between a plurality of theories is beneficial to the philosophical analysis. We may, for example, discover helpful features of one theory that we may want to import into another context, thus enriching our repertoire of formal tools. Or, through comparison with a less well-known theory, we may gain a better understanding of the characteristics of the theories we are familiar with. As argued in this chapter, CTT has much to offer in all of these respects. (shrink)

Type theory is a fast-evolving field at the crossroads of logic, computer science and mathematics. This gentle step-by-step introduction is ideal for graduate students and researchers who need to understand the ins and outs of the mathematical machinery, the role of logical rules therein, the essential contribution of definitions and the decisive nature of well-structured proofs. The authors begin with untyped lambda calculus and proceed to several fundamental type systems culminating in the well-known and powerful Calculus of (...) Constructions. The book also covers the essence of proof checking and proof development, and the use of dependent type theory to formalize mathematics. The only prerequisites are a good knowledge of undergraduate algebra and analysis. Carefully chosen examples illustrate the theory throughout. Each chapter ends with a summary of the content, some historical context, suggestions for further reading and a selection of exercises to help readers familiarize themselves with the material. (shrink)

Selection type theories solve adaptation problems. Natural selection, clonal selection for antibody production, and selective theories of higher brain function are examples. An abstract characterization of typical selection processes is generated by analyzing and extending previous work on the nature of natural selection. Once constructed, this abstraction provides a useful tool for analyzing the nature of other selection theories and may be of use in new instances of theory construction. This suggests the potential fruitfulness of research to find (...) other theory types and construct their abstractions. (shrink)

of type theory has been used successfully to formalize large parts of constructive mathematics, such as the theory of generalized recursive definitions [NPS90, ML79]. Moreover, it is also employed extensively as a framework for the development of high-level programming languages, in virtue of its combination of expressive strength and desirable proof-theoretic properties [NPS90, Str91]. In addition to simple types A, B, . . . and their terms x : A b(x) : B, the theory also has (...) dependent types x : A B(x), which are regarded as indexed families of types. There are simple type forming operations A × B and A → B, as well as operations on dependent types, including in particular the sum x:A B(x) and product x:A B(x) types (see the appendix for details). The Curry-Howard interpretation of the operations A × B and A → B is as propositional conjunction and.. (shrink)

Many philosophers believe in things, propositions, which are the things that we believe, assert etc., and which are the contents of sentences. The act-type theory of propositions is an attempt to say what propositions are, to explain how we stand in relations to them, and to explain why they are true or false. The core idea of the act-type theory is that propositions are types of acts of predication. The theory is developed in various ways (...) to offer explanations of the important properties of propositions. I present the core idea of the theory, and some developments of it. I discuss the relationship between the theory and the content–force distinction. I also present an important type of objection that has been raised to the explanations offered by the act-type theory. (shrink)

We introduce a predicative version of topos based on the notion of small maps in algebraic set theory, developed by Joyal and one of the authors. Examples of stratified pseudotoposes can be constructed in Martin-Löf type theory, which is a predicative theory. A stratified pseudotopos admits construction of the internal category of sheaves, which is again a stratified pseudotopos. We also show how to build models of Aczel-Myhill constructive set theory using this categorical structure.

Prolegomena It is fitting to begin this book on intuitionistic type theory by putting the subject matter into perspective. The purpose of this chapter is to ...

Neil Tennant’s core logic is a type of bilateralist natural deduction system based on proofs and refutations. We present a proof system for propositional core logic, explain its connections to bilateralism, and explore the possibility of using it as a type theory, in the same kind of way intuitionistic logic is often used as a type theory. Our proof system is not Tennant’s own, but it is very closely related, and determines the same consequence relation. (...) The difference, however, matters for our purposes, and we discuss this. We then turn to the question of strong normalization, showing that although Tennant’s proof system for core logic is not strongly normalizing, our modified system is. (shrink)

This paper introduces a multi-modal polymorphic type theory to model epistemic processes characterized by trust, defined as a second-order relation affecting the communication process between sources and a receiver. In this language, a set of senders is expressed by a modal prioritized context, whereas the receiver is formulated in terms of a contextually derived modal judgement. Introduction and elimination rules for modalities are based on the polymorphism of terms in the language. This leads to a multi-modal non-homogeneous version (...) of a type theory, in which we show the embedding of the modal operators into standard group knowledge operators. (shrink)

I explore the possibility of a structuralist interpretation of homotopy type theory (HoTT) as a foundation for mathematics. There are two main aspects to HoTT's structuralist credentials. First, it builds on categorical set theory (CST), of which the best-known variant is Lawvere's ETCS. I argue that CST has merit as a structuralist foundation, in that it ascribes only structural properties to typical mathematical objects. However, I also argue that this success depends on the adoption of a strict (...) typing system which undermines the metaphysical seriousness of this structuralism. Homotopy type theory adds to CST a distinctive theory of identity between sets, which arguably allows its objects to be seen as ante rem structures. I examine the prospects for such a view, and address many other interpretive problems as they arise. (shrink)

Contextual type theories are largely explored in their applications to programming languages, but less investigated for knowledge representation purposes. The combination of a constructive language with a modal extension of contexts appears crucial to explore the attractive idea of a type-theoretical calculus of provability from refutable assumptions for non-monotonic reasoning. This paper introduces such a language: the modal operators are meant to internalize two different modes of correctness, respectively with necessity as the standard notion of constructive verification and (...) possibility as provability up to refutation of contextual conditions. (shrink)

Este artigo canta uma canção — uma canção criada ao unir o trabalho de quatro grandes nomes na história da lógica: Hans Reichenbach, Arthur Prior, Richard Montague, e Leon Henkin. Embora a obra dos primeiros três desses autores tenha sido previamente combinada, acrescentar as ideias de Leon Henkin é o acréscimo requerido para fazer com que essa combinação funcione no nível lógico. Mas o presente trabalho não se concentra nas tecnicalidades subjacentes (que podem ser encontradas em Areces, Blackburn, Huertas, e (...) Manzano [no prelo]), e sim nos instrumentos subjacentes e no modo como trabalham em conjunto. Esperamos que o leitor fique tentado a cantar junto. DOI:10.5007/1808-1711.2011v15n2p225. (shrink)

Homotopy Type Theory is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various questions that (...) a foundation for mathematics might be expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory, and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics?2.1 A characterization of a foundation for mathematics2.2 Autonomy3 The Basic Features of Homotopy Type Theory3.1 The rules3.2 The basic ways to construct types3.3 Types as propositions and propositions as types3.4 Identity3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types5.1 Tokens as mathematical objects?5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy7.1 Framework7.2 Semantics7.3 Metaphysics7.4 Epistemology7.5 Methodology8 Possible Objections to this Account8.1 A constructive foundation for mathematics?8.2 What are concepts?8.3 Isn’t this just Brouwerian intuitionism?8.4 Duplicated objects8.5 Intensionality and substitution salva veritate9 Conclusion9.1 Advantages of this foundation. (shrink)

The aim of this paper is to define a partial Propositional Type Theory. Our system is partial in a double sense: the hierarchy of (propositional) types contains partial functions and some expressions of the language, including formulas, may be undefined. The specific interpretation we give to the undefined value is that of Kleene’s strong logic of indeterminacy. We present a semantics for the new system and prove that every element of any domain of the hierarchy has a name (...) in the object language. Finally, we provide a proof system and a (constructive) proof of completeness. (shrink)

This paper discusses some of the ways in which Martin-Löf type theory differs from set theory. The discussion concentrates on conceptual, rather than technical, differences. It revolves around four topics: sets versus types; syntax; functions; and identity. The difference between sets and types is spelt out as the difference between unified pluralities and kinds, or sorts. A detailed comparison is then offered of the syntax of the two languages. Emphasis is placed on the distinction between proposition and (...) judgement, drawn by type theory, but not by set theory. Unlike set theory, type theory treats the notion of function as primitive. It is shown that certain inconveniences pertaining to function application that afflicts the set- theoretical account of functions are thus avoided. Finally, the distinction, drawn in type theory, between judgemental and propositional identity is discussed. It is argued that the criterion of identity for a domain cannot be formulated in terms of propositional identity. It follows that the axiom of extensionality cannot be taken as a statement of the criterion of identity for sets. (shrink)

In the formal semantics based on modern type theories, common nouns are interpreted as types, rather than as predicates of entities as in Montague’s semantics. This brings about important advantages in linguistic interpretations but also leads to a limitation of expressive power because there are fewer operations on types as compared with those on predicates. The theory of coercive subtyping adequately extends the modern type theories and, as shown in this paper, plays a very useful role in (...) making type theories more expressive for formal semantics. It not only gives a satisfactory solution to the basic problem of ‘multiple categorisation’ caused by interpreting common nouns as types, but provides a powerful formal framework to model interesting linguistic phenomena such as copredication, whose formal treatment has been found difficult in a Montagovian setting. In particular, we show how to formally introduce dot-types in a type theory with coercive subtyping and study some type-theoretic constructs that provide useful representational tools for reference transfers and multiple word meanings in formal lexical semantics. (shrink)

I here discuss two problems facing Russellian act-type theories of propositions, and argue that Fregean act-type theories are better equipped to deal with them. The first relates to complex singular terms like '2+2', which turn out not to pose any special problem for Fregeans at all, whereas Soames' theory currently has no satisfactory way of dealing with them (particularly, with such "mixed" propositions as the proposition that 2+2 is greater than 3). Admittedly, one possibility stands out as (...) the most promising one, but it requires that the Russellian treat complex properties as constituents of propositions. This leads to the second major problem for Russellians: that of proliferating propositions. I show how the most direct solution to this problem, that of rejecting complex predicative propositional constituents is available to Fregeans but very implausible for Russellians, since this virtually means rejecting complex properties. (shrink)

Cumulative Prospect Theory (CPT) does not explain the St. Petersburg Paradox. We show that the solutions related to probability weighting proposed to solve this paradox, (Blavatskyy, Management Science 51:677–678, 2005; Rieger and Wang, Economic Theory 28:665–679, 2006) have to cope with limitations. In that framework, CPT fails to accommodate both gambling and insurance behavior. We suggest replacing the weighting functions generally proposed in the literature by another specification which respects the following properties: (1) to solve the paradox, (...) the slope at zero has to be finite. (2) to account for the fourfold pattern of risk attitudes, the probability weighting has to be strong enough. (shrink)

This volume presents a Type Theory of Law (TTL), claiming that this is a unique theory of law that stems from the philosophical understanding of Jung's psychological types applied to the phenomenon of law. Furthermore, the TTL claims to be a universal, general and descriptive account of law. To prove that, the book first presents the fundamentals of Jungian psychological types, as they had been invented by Jung and consequently developed further by his followers. The next part (...) of the book describes how the typological structure of an individual determines their understanding of law. It then addresses the way in which inclusive legal theory can be understood based on this typology. Finally, the book describes the TTL in general and descriptive terms and puts it into context. All in all, the book shows how the integral or inclusive approach to understanding the nature of law is not only in tune with our time, but also relevant for presenting a more persuasive picture of law than the older exclusivist or dualist approaches of strict natural law and rigid legal positivism did. (shrink)

We conduct a standardized survey on risk preferences in 53 countries worldwide and estimate cumulative prospect theory parameters from the data. The parameter estimates show that significant differences on the cross-country level are to some extent robust and related to economic and cultural differences. In particular, a closer look on probability weighting underlines gender differences, economic effects, and cultural impact on probability weighting. The data set is a useful starting point for future research that investigates the impact of (...) risk preferences on the market level. (shrink)

In light of the close connection between the ontological hierarchy of set theory and the ideological hierarchy of type theory, Øystein Linnebo and Agustín Rayo have recently offered an argument in favour of the view that the set-theoretic universe is open-ended. In this paper, we argue that, since the connection between the two hierarchies is indeed tight, any philosophical conclusions cut both ways. One should either hold that both the ontological hierarchy and the ideological hierarchy are open-ended, (...) or that neither is. If there is reason to accept the view that the set-theoretic universe is open-ended, that will be because such a view is the most compelling one to adopt on the purely ontological front. (shrink)

In this article we define a logical system called Hybrid Partial Type Theory ( $\mathcal {HPTT}$ ). The system is obtained by combining William Farmer’s partial type theory with a strong form of hybrid logic. William Farmer’s system is a version of Church’s theory of types which allows terms to be non-denoting; hybrid logic is a version of modal logic in which it is possible to name worlds and evaluate expressions with respect to particular worlds. (...) We motivate this combination of ideas in the introduction, and devote the rest of the article to defining, axiomatising, and proving a completeness result for $\mathcal {HPTT}$. (shrink)

A version of intuitionistic type theory is extended with opposite types, allowing a different formalization of negation and obtaining a paraconsistent type theory (⁠|$\textsf{PTT} $|⁠). The rules for opposite types in |$\textsf{PTT} $| are based on the rules of the so-called constructible falsity. A propositions-as-types correspondence between the many-sorted paraconsistent logic |$\textsf{PL}_\textsf{S} $| (a many-sorted extension of López-Escobar’s refutability calculus presented in natural deduction format) and |$\textsf{PTT} $| is proven. Moreover, a translation of |$\textsf{PTT} $| into (...) intuitionistic type theory is presented and some properties of |$\textsf{PTT} $| are discussed. (shrink)

Mathematicians often consider Zermelo-Fraenkel Set Theory with Choice (ZFC) as the only foundation of Mathematics, and frequently don’t actually want to think much about foundations. We argue here that modern Type Theory, i.e. Homotopy Type Theory (HoTT), is a preferable and should be considered as an alternative.

This article proposes a way of doing type theory informally, assuming a cubical style of reasoning. It can thus be viewed as a first step toward a cubical alternative to the program of informalization of type theory carried out in the homotopy type theory book for dependent type theory augmented with axioms for univalence and higher inductive types. We adopt a cartesian cubical type theory proposed by Angiuli, Brunerie, Coquand, Favonia, (...) Harper, and Licata as the implicit foundation, confining our presentation to elementary results such as function extensionality, the derivation of weak connections and path induction, the groupoid structure of types, and the Eckmman–Hilton duality. (shrink)

Homotopy Type Theory is a proposed new language and foundation for mathematics, combining algebraic topology with logic. An important rule for the treatment of identity in HoTT is path induction, which is commonly explained by appeal to the homotopy interpretation of the theory's types, tokens, and identities as spaces, points, and paths. However, if HoTT is to be an autonomous foundation then such an interpretation cannot play a fundamental role. In this paper we give a derivation of (...) path induction, motivated from pre-mathematical considerations, without recourse to homotopy theory. (shrink)

The article deals with an approach to the analysis of propositional attitudes based on the type-theoretical semantics proposed by A. Ranta and originating from the type theory of P. Martin-Löf. Type-theoretical semantics contains the notion of context and tools of extracting information from it in an explicit form. This allows us to correctly formalize the dependence on contexts typical of propositional attitudes. In the article the context is presented as a dependent sum type (Record (...) class='Hi'>type in the proof assistant Coq). Ranta’s approach is refined and applied to the analysis of Quine’s phrase “Ralph believes that someone is a spy”. Three variants of formalization for this phrase are described which differ in the content of contextual knowledge and the way the truth values of the phrase are derived. Contexts are connected through the function of conversion, making it possible to relate truth values. As a result, it is shown that the instruments for working with contexts provided by type-theoretical semantics allow us to avoid the problem of opacity described by Quine. Provided formalization along with proofs is coded in Coq and made freely available. (shrink)

In this paper we show that the usual intuitionistic characterization of the decidability of the propositional function B prop [x : A], i. e. to require that the predicate ∨ ¬ B) is provable, is equivalent, when working within the framework of Martin-Löf's Intuitionistic Type Theory, to require that there exists a decision function ψ: A → Boole such that = Booletrue) ↔ B). Since we will also show that the proposition x = Booletrue [x: Boole] is decidable, (...) we can alternatively say that the main result of this paper is a proof that the decidability of the predicate Bprop [x : A] can be effectively reduced by a function ψ A → Boole to the decidability of the predicate ψ = Booletrue [x : A]. All the proofs are carried out within the Intuitionistic Type Theory and hence the decision function ψ, together with a proof of its correctness, is effectively constructed as a function of the proof of ∨ ¬ B). (shrink)

Much behavioral welfare economics assumes that expected utility theory does not accurately describe most human choice under risk. A substantial literature instead evaluates welfare consequences by taking cumulative prospect theory as the natural default alternative, at least where description is concerned. We present evidence, based on a review of previous literature and new experimental data, that the most empirically adequate hypothesis about human choice under risk is that it is heterogeneous, and that where EUT does not apply, (...) more choice is characterized by rank-dependent utility models than by CPT. Most of the apparently loss-averse choice behavior results from probability weighting rather than from direct disutility experienced when an outcome is framed as a loss against an idiosyncratic reference point. We then consider implications of this finding for methodological debates about how to model welfare effects of policies, and argue that abandonment of a dogmatic belief in CPT as the correct theory of risk human choice exposes a conceptual error that is widespread in behavioral welfare economics. We provide concluding reflections on second-order, philosophical issues around the grounding of normative commitments in policy-focused economics. (shrink)

Homotopy Type Theory (HoTT) is a putative new foundation for mathematics grounded in constructive intensional type theory that offers an alternative to the foundations provided by ZFC set theory and category theory. This article explains and motivates an account of how to define, justify, and think about HoTT in a way that is self-contained, and argues that, so construed, it is a candidate for being an autonomous foundation for mathematics. We first consider various questions (...) that a foundation for mathematics might be expected to answer, and find that many of them are not answered by the standard formulation of HoTT as presented in the ‘HoTT Book’. More importantly, the presentation of HoTT given in the HoTT Book is not autonomous since it explicitly depends upon other fields of mathematics, in particular homotopy theory. We give an alternative presentation of HoTT that does not depend upon ideas from other parts of mathematics, and in particular makes no reference to homotopy theory (but is compatible with the homotopy interpretation), and argue that it is a candidate autonomous foundation for mathematics. Our elaboration of HoTT is based on a new interpretation of types as mathematical concepts, which accords with the intensional nature of the type theory. 1 Introduction2 What Is a Foundation for Mathematics? 2.1 A characterization of a foundation for mathematics 2.2 Autonomy3 The Basic Features of Homotopy Type Theory 3.1 The rules 3.2 The basic ways to construct types 3.3 Types as propositions and propositions as types 3.4 Identity 3.5 The homotopy interpretation4 Autonomy of the Standard Presentation?5 The Interpretation of Tokens and Types 5.1 Tokens as mathematical objects? 5.2 Tokens and types as concepts6 Justifying the Elimination Rule for Identity7 The Foundations of Homotopy Type Theory without Homotopy 7.1 Framework 7.2 Semantics 7.3 Metaphysics 7.4 Epistemology 7.5 Methodology8 Possible Objections to this Account 8.1 A constructive foundation for mathematics? 8.2 What are concepts? 8.3 Isn’t this just Brouwerian intuitionism? 8.4 Duplicated objects 8.5 Intensionality and substitution salva veritate9 Conclusion 9.1 Advantages of this foundation. (shrink)

A version of intuitionistic type theory is presented here in which all logical symbols are defined in terms of equality. This language is used to construct the so-called free topos with natural number object. It is argued that the free topos may be regarded as the universe of mathematics from an intuitionist's point of view.