Image factorizations in regular categories are stable under pullbacks, so they model a natural modal operator in dependent type theory. This unary type constructor [A] has turned up previously in a syntactic form as a way of erasing computational content, and formalizing a notion of proof irrelevance. Indeed, semantically, the notion of a support is sometimes used as surrogate proposition asserting inhabitation of an indexed family. We give rules for bracket types in dependent type theory and provide complete semantics (...) using regular categories. We show that dependent type theory with the unit type, strong extensional equality types, strong dependent sums, and bracket types is the internal type theory of regular categories, in the same way that the usual dependent type theory with dependent sums and products is the internal type theory of locally Cartesian closed categories. We also show how to interpret first-order logic in type theory with brackets, and we make use of the translation to compare type theory with logic. Specifically, we show that the propositions-as-types interpretation is complete with respect to a certain fragment of intuitionistic first-order logic, in the sense that a formula from the fragment is derivable in intuitionistic first-order logic if, and only if, its interpretation in dependent type theory is inhabited. As a consequence, a modified double-negation translation into type theory (without bracket types) is complete, in the same sense, for all of classical first-order logic. (shrink)

In this paper I defend an account of the nature of propositional content according to which the proposition expressed by a declarative sentence is a certain type of action a speaker performs in uttering that sentence. On this view, the semantic contents of proper names turn out to be types of reference acts. By carefully individuating these types, it is possible to provide new solutions to Frege’s puzzles about names in identity- and belief-sentences.

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. In a preceding paper, [2], we considered 4 systems of illative combinatory logic that are sound for first order intuitionistic propositional and predicate logic. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, (...) in which derivations are not translated. Both translations are closely related in a canonical way. In the cited paper we proved completeness of the two direct translations. In the present paper we prove that also the two indirect translations are complete. These proofs are direct whereas in another version, [3], we proved completeness by showing that the two corresponding illative systems are conservative over the two systems for the direct translations. Moreover we shall prove that one of the systems is also complete for predicate calculus with higher type functions. (shrink)

// tl;dr A Proposition is a Way of Thinking // -/- This chapter is about type-theoretic approaches to propositional content. Type-theoretic approaches to propositional content originate with Hintikka, Stalnaker, and Lewis, and involve treating attitude environments (e.g. "Nate thinks") as universal quantifiers over domains of "doxastic possibilities" -- ways things could be, given what the subject thinks. -/- This chapter introduces and motivates a line of a type-theoretic theorizing about content that is an outgrowth of the recent literature on epistemic (...) modality, according to which contentful thought is broadly "informational" in its nature and import. The general idea here is that an object of thought is not a way *the world* could be, but rather a way *one's perspective* could be (with respect to a relevant representational question). I will spend the middle part of this chapter motivating and developing a version of this strategy that is, I’ll argue, well-suited to explaining clear phenomena concerning the attribution of perspectival attitudes -- in particular, attitudes towards loosely information-sensitive propositions -- with which extant approaches struggle. My overarching goal here will be to motivate a distinctive version of the "informational" approach -- the "Flexible Types" approach, which is based on the theory proposed in Charlow (2020). According to the Flexible Types approach, propositional attitude verbs are quantifiers over sets of possibilities, but a possibility is a type-flexible notion -- sometimes a possible world, sometimes a perspective, sometimes a set of possible worlds, sometimes a set of perspectives. -/- After introducing the Flexible Types approach, this chapter circles back to more traditional concerns for the analysis of propositions as types of possibilities -- Frege's Puzzle and the problem of Logical Omniscience. Here too the Flexible Types approach bears fruit. Although there are certainly significant differences -- I note some in the concluding section -- the gist of this theory is Hinitkkan or Lewisian in spirit (if not quite in letter). We can make progress on addressing the challenges for the analysis of propositional content in terms of types of possibilities, through empirically driven refinement of our notion of what kind of thing a "doxastic possibility" is. (shrink)

According to act theories, propositions are structured cognitive act‐types. Act theories appear to make propositions inherently representational and truth‐evaluable, and to provide solutions to familiar problems with alternative theories, including Frege’s and Russell’s problems, and the third‐realm and unity problems. Act theories have critical problems of their own, though: acts as opposed to their objects are not truth evaluable, not structured in the right way, not expressed by sentences, and not the objects of propositional attitudes. I show (...) how identifying propositions with other cognitive event‐types, namely thoughts, has the perceived virtues of act theories without the defects. (shrink)

Kosta Došen argued in his papers Inferential Semantics (in Wansing, H. (ed.) Dag Prawitz on Proofs and Meaning, pp. 147–162. Springer, Berlin 2015) and On the Paths of Categories (in Piecha, T., Schroeder-Heister, P. (eds.) Advances in Proof-Theoretic Semantics, pp. 65–77. Springer, Cham 2016) that the propositions-as-types paradigm is less suited for general proof theory because—unlike proof theory based on category theory—it emphasizes categorical proofs over hypothetical inferences. One specific instance of this, Došen points out, is that the (...) Curry–Howard isomorphism makes the associativity of deduction composition invisible. We will show that this is not necessarily the case. (shrink)

Without violating the spirit of Game-Theoretical semantics, its results can be re-worked in Martin-Löf''s Constructive Type Theory by interpreting games as types of Myself''s winning strategies. The philosophical ideas behind Game-Theoretical Semantics in fact highly recommend restricting strategies to effective ones, which is the only controversial step in our interpretation. What is gained, then, is a direct connection between linguistic semantics and computer programming.

I propose a version of the act‐type theory of propositions, following Hanks and Soames. According to the theory, propositions are types of act of predication. The content of a sentence is the type of such act performed when that sentence is uttered. A consequence of this theory is that the structure of the content of a sentence will mirror the structure of that sentence. I defend this consequence of the theory from two important objections. I then argue (...) that this theory is well motivated because it can be part of a theory of what is said. (shrink)

This paper critiques the view, widely held by philosophers of mind and cognitive scientists, that psychological explanation is a matter of ascribing propositional attitudes (such as beliefs and desires) towards language-like propositions in the mind, and that cognitive mental states consist in intentional attitudes towards propositions of a linguistic quasi-linguistic nature. On this view, thought is structured very much like a language. Denial that propositional attitude psychology is an adequate account of mind is therefore, on this view, is (...) tantamount to eliminative materialism, the denial that human beings are thinking beings. -/- I dispute this on the basis of recent work in cognitive psychology and artificial intelligence. Mental models theory, on which thought is better understood as nonpropositional intentional psychology, accords better with the evidence and offers an alternative view to propositional attitude psychology -- one that means that the denial that that is propositional is not eliminative. However, I argue that propositional attitude psychology is a useful idealization, as classical mechanics is of relativity theory, strictly but not radically false, and useful for prediction and indeed, as long as its idealized character is born in mind, for explanation of behavior. (shrink)

The paradox of propositions, presented in Appendix B of Russell's The Principles of Mathematics (1903), is usually taken as Russell's principal motive, at the time, for moving from a simple to a ramified theory of types. I argue that this view is mistaken. A closer study of Russell's correspondence with Frege reveals that Russell carne to adopt a very different resolution of the paradox, calling into question not the simplicity of his early type theory but the simplicity of (...) his early theory of propositions. (shrink)

According to Lynne Rudder Baker’s Practical Realism, we know that we have beliefs, desires, and other propositional attitudes independent of any scientific investigation. Propositional attitudes are an indispensable part of our everyday conception of the world and not in need of scientific validation. This paper asks what is the nature of the attitudes such that we may know them so well from a commonsense perspective. I argue for a self-ascriptivist view, on which we have propositional attitudes in virtue of ascribing (...) them to ourselves. On this view, propositional attitudes are derived representational states, deriving their contents and their attitude types from our self-ascriptions. (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 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)

The paradox of propositions, presented in Appendix B of Russell's The Principles of Mathematics (1903), is usually taken as Russell's principal motive, at the time, for moving from a simple to a ramified theory of types. I argue that this view is mistaken. A closer study of Russell's correspondence with Frege reveals that Russell carne to adopt a very different resolution of the paradox, calling into question not the simplicity of his early type theory but the simplicity of (...) his early theory of propositions. (shrink)

This Element is an exposition of second- and higher-order logic and type theory. It begins with a presentation of the syntax and semantics of classical second-order logic, pointing up the contrasts with first-order logic. This leads to a discussion of higher-order logic based on the concept of a type. The second Section contains an account of the origins and nature of type theory, and its relationship to set theory. Section 3 introduces Local Set Theory, an important form of type theory (...) based on intuitionistic logic. In Section 4 number of contemporary forms of type theory are described, all of which are based on the so-called 'doctrine of propositions as types'. We conclude with an Appendix in which the semantics for Local Set Theory - based on category theory - is outlined. (shrink)

When analyzing 'justified factual knowledge that h', we must speak of justified belief in h and also of h's being a justified proposition. Gettier-type problems can be dealt with by requiring that the belief in h be justified through its connection with a 'justification-explaining chain' related to h. The social aspects of knowledge can be encompassed by analyzing what it is for h to be a justified proposition in terms of h's relation to the rationality of an 'epistemic community'.The discussion (...) explains these analyses, and shows how to concept of a justification-explaining chain is related to Ernest Sosa's concept of a 'tree of knowledge'. The present account of justification is seen to be preferable.A rationale for appealing to justification-explaining chains emerges from Popper's concern with another type of knowledge, namely, sets of propositions embedded in systems used by epistemic communities in pursuit of epistemic goals.In conclusion, the present approach is related to a number of examples found in the literature concerning the social aspects of knowledge. (shrink)

Unbound anaphoric pronouns or ‘E-type pronouns’ have presented notorious problems for semantic theory, leading to the development of dynamic semantics, where the primary function of a sentence is not considered that of expressing a proposition that may act as the object of propositional attitudes, but rather that of changing the current information state. The older, ‘E-type’ account of unbound anaphora leaves the traditional notion of proposition intact and takes the unbound anaphor to be replaced by a full NP whose semantics (...) is assumed to be known (e.g. a definite description). In this paper, I argue that there are serious problems with any version of the E-type account as well as the (original form of the) dynamic account. I will explore a new account based on structured propositions, which can be considered a conservative extension of a traditional proposition-based semantics, but which at the same time incorporates some crucial insights of the dynamic account. (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)

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)

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)

Semantic Minimalists make a proprietary claim to explaining the possibility of utterances sharing content across contexts. Further, they claim that an inability to explain shared content dooms varieties of Contextualism. In what follows, I argue that there are a series of barriers to explaining shared content for the Minimalist, only some of which the Contextualist also faces, including: (i) how the type-identity of utterances is established, (ii) what counts as repetition of type-identical utterances, (iii) how it can be determined whether (...) semantically minimal content has been repeated, and (iv) what the nature of such content is. (shrink)

We present a generalisation of the type-theoretic interpretation of constructive set theory into Martin-Löf type theory. The original interpretation treated logic in Martin-Löf type theory via the propositions-as-types interpretation. The generalisation involves replacing Martin-Löf type theory with a new type theory in which logic is treated as primitive. The primitive treatment of logic in type theories allows us to study reinterpretations of logic, such as the double-negation translation.

Constructive Zermelo–Fraenkel set theory, CZF, can be interpreted in Martin-Löf type theory via the so-called propositions-as-types interpretation. However, this interpretation validates more than what is provable in CZF. We now ask ourselves: is there a reasonably simple axiomatization of the set-theoretic formulae validated in Martin-Löf type theory? The answer is yes for a large collection of statements called the mathematical formulae. The validated mathematical formulae can be axiomatized by suitable forms of the axiom of choice.The paper builds on (...) a self-interpretation of CZF IOS Press, Amsterdam, 2004 ]) that provides an “inner” model of CZF which also validates the so-called -axiom of choice, . The crucial technical step taken in the present paper is to investigate the absoluteness properties of this model under the hypothesis .It is also shown that CZF plus the -axiom of choice possesses the disjunction property, the numerical existence property and the existence property for an important group of formulae. (shrink)

Propositionalism is the view that intentional attitudes, such as belief, are relations to propositions. Propositionalists argue that propositionalism follows from the intuitive validity of certain kinds of inferences involving attitude reports. Jubien (2001) argues powerfully against propositions and sketches some interesting positive proposals, based on Russell’s multiple relation theory of judgment, about how to accommodate “propositional phenomena” without appeal to propositions. This paper argues that none of Jubien’s proposals succeeds in accommodating an important range of propositional phenomena, (...) such as the aforementioned validity of attitude-report inferences. It then shows that the notion of a predication act-type, which remains importantly Russellian in spirit, is sufficient to explain the range of propositional phenomena in question, in particular the validity of attitude-report inferences. The paper concludes with a discussion of whether predication act-types are really just propositions by another name. (shrink)

We present a framework for intensional reasoning in typed -calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a propositions-as-types-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.

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)

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators, or in a more direct way, in which derivations are not translated. (...) Both translations are closely related in a canonical way. In a preceding paper, Barendregt, Bunder and Dekkers, 1993, we proved completeness of the two direct translations. In the present paper we prove completeness of the two indirect translations by showing that the corresponding illative systems are conservative over the two systems for the direct translations. In another version, DBB (1997), we shall give a more direct completeness proof. These papers fulfill the program of Church and Curry to base logic on a consistent system of $\lambda$ -terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). (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)

Those inclined to believe in the existence of propositions as traditionally conceived might seek to reduce them to some other type of entity. However, parsimonious propositionalists of this type are confronted with a choice of competing candidates – for example, sets of possible worlds, and various neo-Russellian and neo-Fregean constructions. It is argued that this choice is an arbitrary one, and that it closely resembles the type of problematic choice that, as Benacerraf pointed out, bedevils the attempt to reduce (...) numbers to sets – should the number 2 be identified with the set Ø or with the set Ø, Ø? An “argument from arbitrary identification” is formulated with the conclusion that propositions (and perhaps numbers) cannot be reduced away. Various responses to this argument are considered, but ultimately rejected. The paper concludes that the argument is sound: propositions, at least, are sui generis entities. (shrink)

According to the classical account, propositions are sui generis, abstract, intrinsically-representational entities and our cognitive attitudes, and the token states within us that realize those attitudes, represent as they do in virtue of their propositional objects. In light of a desire to explain how it could be that propositions represent, much of the recent literature on propositions has pressured various aspects of this account. In place of the classical account, revisionists have aimed to understand propositions in (...) terms of more familiar entities such as facts, types of mental or linguistic acts, and even properties. But we think that the metaphysical story about propositions is much simpler than either the classical theorist or the revisionist would have you believe. In what follows, we argue that a proper understanding of the nature of our cognitive relations to propositions shows that the question of whether propositions themselves represent is, at best, a distraction. We will argue that once this distraction is removed, the possibility of a very pleasing, minimalist story of propositions emerges; a story that appeals only to assumptions that are shared by all theorists in the relevant debate. (shrink)

A Ramsey statement denoted \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${n \longrightarrow (k)^2_2}$$\end{document} says that every undirected graph on n vertices contains either a clique or an independent set of size k. Any such valid statement can be encoded into a valid DNF formula RAM(n, k) of size O(nk) and with terms of size \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\left(\begin{smallmatrix}k\\2\end{smallmatrix}\right)}$$\end{document}. Let rk be the minimal n for which the statement holds. We prove that (...) RAM(rk, k) requires exponential size constant depth Frege systems, answering a problem of Krishnamurthy and Moll [15]. As a consequence of Pudlák’s work in bounded arithmetic [19] it is known that there are quasi-polynomial size constant depth Frege proofs of RAM(4k, k), but the proof complexity of these formulas in resolution R or in its extension R(log) is unknown. We define two relativizations of the Ramsey statement that still have quasi-polynomial size constant depth Frege proofs but for which we establish exponential lower bound for R. (shrink)

This conceptual article applies the customer value (CV) concept in the context of green marketing aiming to provide insights on the factors that motivate and/or hinder the development of consumer–green brand relationships. The article draws upon existing literature on the streams of CV, relationship marketing and environmental behaviour and synthesises relevant findings to propose an integrated conceptual framework entailing all identified types of value and cost, psychographic characteristics, as well as dimensions of relationship quality (RQ) and loyalty. Furthermore, it (...) addresses existing questions on the links among constructs and proposes several relationships that may lead to a better understanding of consumer behaviour towards green brands. Through the here-proposed conceptual model, the article initiates the process of empirically examining the consumer adoption of and relationship development with green brands. The CV framework adopted here may provide practitioners with knowledge on the value and sacrifice factors, as well as the dimensions of RQ that are the most important in targeting green consumers and designing relationship marketing strategies. The article also fulfils an identified gap in the literature, as it is the first that brings together and applies research findings from CV and relationship marketing fields in the green marketing context and proposes an integrated approach to understanding consumer–green brands relationships. (shrink)

The proofs of universally quantified statements, in mathematics, are given as “schemata” or as “prototypes” which may be applied to each specific instance of the quantified variable. Type Theory allows to turn into a rigorous notion this informal intuition described by many, including Herbrand. In this constructive approach where propositions are types, proofs are viewed as terms of λ-calculus and act as “proof-schemata”, as for universally quantified types. We examine here the critical case of Impredicative Type Theory, (...) i. e. Girard's system F, where type-quantification ranges over all types. Coherence and decidability properties are proved for prototype proofs in this impredicative context. (shrink)

Propositions are more than the bearers of truth and the meanings of sentences: they are also the objects of an array of attitudes including belief, desire, hope, and fear. This variety of roles leads to a variety of paradoxes, most of which have been sorely neglected. Arguing that existing work on these paradoxes is either too heavy-handed or too specific in its focus to be fully satisfactory, I develop a basic intensional logic and pursue and compare three strategies for (...) addressing the paradoxes, one employing truth-value gaps, one restricting propositional quantification, and one restricting our ability to have attitudes like belief and desire. This results in four distinct resolutions of the paradoxes, all but one of which are novel and all of which receive novel and general implementations. While resolving the paradoxes is of course the ultimate goal, I do not here argue that any one of the resolutions is superior. These paradoxes have been so little studied that my primary goal is only to identify the most fundamental costs and benefits of the various approaches one can take to addressing them. Each resolution I develop has significant drawbacks, which I argue highlight tensions between the different roles propositions play. Past researchers have skirted these tensions, and the issues raised by these paradoxes more generally, by focusing on non-propositional paradoxes, such as the most familiar forms of the Liar paradox. At the least, then, I hope this dissertation establishes that the propositional paradoxes deserve attention not only because of their consequences for intensional logic, but also because of their consequences for our understanding of content, truth, quantification, and a host of mental attitudes. (shrink)

Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: following the propositions-as-types paradigm, in which derivations become combinators or, in a more direct way, in which derivations are not translated. Both (...) translations are closely related in a canonical way. The two direct translations turn out to be complete. The paper fulfills the program of Church [1932], [1933] and Curry [1930] to base logic on a consistent system of λ-terms or combinators. Hitherto this program had failed because systems of ICL were either too weak (to provide a sound interpretation) or too strong (sometimes even inconsistent). (shrink)

Scott Soames has recently argued that traditional accounts of propositions as n-tuples or sets of objects and properties or functions from worlds to extensions cannot adequately explain how these abstract entities come to represent the world. Soames’ new cognitive theory solves this problem by taking propositions to be derived from agents representing the world to be a certain way. Agents represent the world to be a certain way, for example, when they engage in the cognitive act of predicating, (...) or cognizing, an act that takes place during cognitive events, such as perceiving, believing, judging and asserting. On the cognitive theory, propositions just are act types involving the act of predicating and certain other mental operations. This theory, Soames argues, solves not only the problem of how propositions come to represent but also a number of other difficulties for traditional theories, including the problem of de se propositions and the problems of accounting for how agents are capable of grasping propositions and how they come to stand in the relation of expression to sentences. I argue here that Soames’ particular version of the cognitive theory makes two problematic assumptions about cognitive operations and the contents of proper names. I then briefly examine what can count as evidence for the nature of the constituents of the cognitive operation types that produce propositions and argue that the common nature of cognitive operations and what they operate on ought to be determined empirically in cross-disciplinary work. I conclude by offering a semantics for cognitive act types that accommodates one type of empirical evidence. (shrink)

_ Source: _Volume 6, Issue 2-3, pp 165 - 181 Wittgenstein’s notion of ‘hinge propositions’—those propositions that stand fast for us and around which all empirical enquiry turns—remains controversial and elusive, and none of the recent attempts to make sense of it strike me as entirely satisfactory. The literature on this topic tends to divide into two camps: either a ‘quasi-epistemic’ reading is offered that seeks to downplay the radical nature of Wittgenstein’s proposal by assimilating his thought to (...) more mainstream epistemological views, or a non-epistemic, ‘quasi-pragmatic’ conception is adopted that goes too far in the opposite direction by, for example, equating ‘hinge propositions’ with a type of ‘animal’ certainty. Neither interpretative strategy, I will argue, is promising for the reason that ‘hinges’ are best not conceived as certainties at all. Rather, what Wittgenstein says in respect to them is that doubt is “logically” excluded, and where there can be no doubt, I contend, there is no such thing as knowledge or certainty either. (shrink)

Hanks develops a theory of propositions as speech-act types. Because speech acts play a role in the contents themselves, the view overturns Frege’s force/content distinction, and as such, faces the challenge of explaining how propositions embed under logical operators like negation. The attempt to solve this problem has lead Hanks and his recent commentators to adopt theoretically exotic resources, none of which, we argue, is ultimately successful. The problem is that although there are three different ways of (...) negating the sentence “Mary’s card is an ace”, current speech-act theories of propositions can only accommodate two of them. We distinguish between “It is false that Mary’s card is an ace”, “Mary’s card is a non-ace”, and “Mary’s card is not an ace” and show that Hanks and his commentators cannot explain content negation. We call this Hanks’ Negation Problem. The problem is significant because content negation is the negation required for logic. Fortunately, we think there is a natural way for Hanks to accommodate content negation as successive acts of predication. The view solves Hanks’ Negation Problem with only resources internal to Hanks’ own view. (shrink)

This paper, based on research in a forthcoming monograph, Commitment in Dialogue, undertaken jointly with Erik Krabbe, explains several informal fallacies as shifts from one type of dialogue to another. The normative framework is that of a dialogue where two parties reason together, incurring and retracting commitments to various propositions as the dialogue continues. The fallacies studied include the ad hominem, the slippery slope, and many questions.

The formulas-as-types isomorphism tells us that every proof and theorem, in the intuitionistic implicational logic $H_\rightarrow$, corresponds to a lambda term or combinator and its type. The algorithms of Bunder very efficiently find a lambda term inhabitant, if any, of any given type of $H_\rightarrow$ and of many of its subsystems. In most cases the search procedure has a simple bound based roughly on the length of the formula involved. Computer implementations of some of these procedures were done in (...) Dekker. In this paper we extend these methods to full classical propositional logic as well as to its various subsystems. This extension has partly been implemented by Oostdijk. (shrink)

As Alasdair Urquhart has noted, Bertrand Russell asserted that developing the theory of definite descriptions from 1905 was the first step towards solving the paradoxes that were finally resolved after 1908 in Principia Mathematica with the theory of types. I extend Urquhart’s suggestion that Russell was referring to the use of the notion of incomplete symbol in his solution to the paradoxes in his doomed theory “substitutional theory” of “Russellian propositions” in 1906. The Introduction to PM states that (...) expressions for propositions are incomplete symbols. This paper assesses the status of propositions in PM and connects the theory of types with the theory of descriptions. (shrink)

We present a formal theory of propositions and combinator terms, and in this theory we give an interpretation of Martin-Löf's type theory. The construction of the interpretation is inspired by the semantics for type theory, but it can also be viewed as a formalized realizability interpretation.

There are propositions constituting the content of fictions—sometimes of the utmost importance to understand them—which are not explicitly presented, but must somehow be inferred. This essay deals with what these inferences tell us about the nature of fiction. I will criticize three well-known proposals in the literature: those by David Lewis, Gregory Currie, and Kendall Walton. I advocate a proposal of my own, which I will claim improves on theirs. Most important for my purposes, I will argue on this (...) basis, against Walton’s objections, for an illocutionary-act account of fiction, inspired in part by some of Lewis’s and Currie’s suggestions, but (perhaps paradoxically) above all by Walton’s deservedly influential views. (shrink)

In formal semantics based on modern type theories, some sentences may be interpreted as judgements and some as logical propositions. When interpreting composite sentences, one may want to turn a judgemental interpretation or an ill-typed semantic interpretation into a proposition in order to obtain an intended semantics. For instance, an incorrect judgement $$a:A$$ may be turned into its propositional form $$\textsc {is}(A,a)$$ and an ill-typed application p(a) into $$\textsc {do}(p,a)$$, so that the propositional forms can take part in logical (...) compositions that interpret composite sentences, especially those that involve negations and conditionals.In this paper, we propose an operator not that facilitates such a transformation. Introducing not axiomatically, with five axiomatic laws to govern its behaviour, we shall use it to define $$\textsc {is}$$ and $$\textsc {do}$$ and give examples to illustrate its use in semantic interpretation. The introduction of not into type theories is logically consistent – this is justified by showing that not can be defined by means of the heterogeneous equality $$\textrm{JMeq}$$ so that all of the axiomatic laws for not become provable. Therefore, since the extension with $$\textrm{JMeq}$$ preserves logical consistency, so does the extension with not. We shall also study conditions under which $$\textsc {is}$$ and $$\textsc {do}$$ operators can be used safely without the risk of over-generation. (shrink)

The analysis of atomic sentences and their subatomic components poses a special problem for proof-theoretic approaches to natural language semantics, as it is far from clear how their semantics could be explained by means of proofs rather than denotations. The paper develops a proof-theoretic semantics for a fragment of English within a type-theoretical formalism that combines subatomic systems for natural deduction [20] with constructive (or Martin-Löf) type theory [8, 9] by stating rules for the formation, introduction, elimination and equality of (...) atomic propositions understood as types (or sets) of subatomic proof-objects. The formalism is extended with dependent types to admit an interpretation of non-atomic sentences. The paper concludes with applications to natural language including internally nested proper names, anaphoric pronouns, simple identity sentences, and intensional transitive verbs. (shrink)

The content of our propositional attitudes is often characterized by assigning them abstract entities, namely propositions. In decision theory the attitudes are also assigned numerical measures. It may thus be asked how assignments of these two types are related to each other — both metaphysically and structurally. In the first section of this paper I argue for the importance of this question and I review Davidson’s unified account of decision theory and radical interpretation as a failed attempt to (...) answer it. Then, in the main part of the paper, I present a unified measurement-theoretic account of linguistic meaning, propositional mental content, and action, an account that avoids the difficulties of Davidson’s picture. Thus in the second section I outline two theoretical preliminaries (the representational theory of measurement and Savage’s decision theory), in the third section I present the proposed novel account, and in the fourth section I defend it against various objections. (shrink)

In this study, we examine the problem of belief revision, defined as deciding whic h of several initially-accepted sentences to disbelieve, when new information presents a l ogical inconsistency with the initial set. In the first three experiments, the initial sentence set included a conditional sentence, a non-conditional sentence, and an inferred conclusi on drawn from the first two. The new information contradicted the inferred conclusion. Results indicated that the conditional sentences were more readily abandoned than non-c onditional sentences, even (...) when either choice would lead to a consistent belief state, and that this preference was more pronounced when problems used natural language cover sto ries rather than symbols. The pattern of belief revision choices differed depending on whe ther the contradicted conclusion from the initial belief set had been a modus ponens or m odus tollens inference. Two additional experiments examined alternative model-theoretic definitions of minimal change to a belief state, using problems that contained multiple mo dels of the initial belief state and of the new information that provided the contradiction. The results indicated that people did not follow any of four formal definitions of minimal change on these problems. The new information and the contradiction it offered was not, for example, used to select a particular model of the initial belief state as a way of reconci ling the contradiction. The preferred revision was to retain only those initial sentences th at had the same, unambiguous truth value within and across both the initial and new info rmation sets. The study and results are presented in the context of certain logic-based for malizations of belief revision, syntactic and model-theoretic representations of belief stat es, and performance models of human deduction. Principles by which some types of sent ences might be more "entrenched" than others in the face of contradiction are also discuss ed from the perspective of induction and theory revision. (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 put 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)

Johnston maintains that the notion of a proposition -- ”a language independent (abstract) particular” -- can be dispensed with in philosophical semantics and replaced with that of a propositional act. A propositional act is a component of a speech act that is responsible for the propositional content of the speech act. Traditionally, it is thought that a propositional act yields the propositional content of a speech act by being an act of expressing a proposition. And it is the expressed proposition (...) that serves as the propositional content of the speech act. Johnston points out, however, that a propositional act is a structured event consisting minimally of a referential act, a predicative act, and a time-designative act. And on Johnston's view, the propositional content is the structured propositional act itself. (Strictly speaking, Johnston analyzes sameness of propositional content in terms of sameness of propositional act type, from which I, perhaps rashly, inferred that the propositional content of a speech act should be taken to be the propositional act itself). Johnston argues that a semantic analysis in terms of propositional acts enables us to reconcile the necessity of both, (1) Hesperus is Phosphorus (2) Phosphorus is Phosphorus with their intuitive difference in meaning, while maintaining the direct reference theory of proper names. Moreover, he argues that invoking propositional acts rather than propositions has the advantage of being able to capture the various senses in which distinct statements might be said to "say the same thing", as well as that of ontological parsimony. I will address each of these claims in turn, but first, I want to point out that the propositionalist can easily reconcile the necessity of (1) and (2) with their intuitive difference in meaning, without forsaking direct reference. All one needs to do is invoke the Fregean idea that there is a meaning shift in “thatâ€-clauses of (opaque) indirect discourse (and other) ascriptions.. (shrink)

, which uses the intuitionistic propositional calculus, with the only connective →. It is very important, because the well known Curry-Howard correspondence between proofs and programs was originally discovered with it, and because it enjoys the normalization property: every typed term is strongly normalizable. It was extended to second order intuitionistic logic, in 1970, by J.-Y. Girard [4], under the name of system F, still with the normalization property.More recently, in 1990, the Curry-Howard correspondence was extended to classical logic, following (...) Felleisen and Griffin [6] who discovered that the law of Peirce corresponds to control instructions in functional programming languages. It is interesting to notice that, as early as 1972, Clint and Hoare [1] had made an analogous remark for the law of excluded middle and controlled jump instructions in imperative languages.There are now many type systems which are based on classical logic; among the best known are the system LC of J.-Y. Girard [5] and the λμ-calculus of M. Parigot [11]. We shall use below a system closely related to the latter, called the λ c -calculus [8, 9]. Both systems use classical second order logic and have the normalization property.In the sequel, we shall extend the λ c -calculus to the Zermelo-Frænkel set theory. The main problem is due to the axiom of extensionality. To overcome this difficulty, we first give the axioms of ZF in a suitable (equivalent) form, which we call ZF ɛ. (shrink)

Neo-Russellian theories of structured propositions face challenges to do with both representation and structure which are sometimes called the problem of unity and the Benacerraf problem. In §i, I set out the problems and Jeffrey King's solution, which I take to be the best of its type, as well as an unfortunate consequence for that solution. In §§ii–iii, I diagnose what is going wrong with this line of thought. If I am right, it follows that the Benacerraf problem cannot (...) be used to motivate the view that propositions are irreducible elements of our ontology. (shrink)