In this pioneering book Kasia Jaszczolt lays down the foundations of an original theory of meaning in discourse, reveals the cognitive foundations of discourse interpretation, and puts forward a new basis for the analysis of discourse processing. She provides a step-by-step introduction to the theory and its application, and explains new terms and formalisms as required. Dr Jaszczolt unites the precision of truth-conditional, dynamic approaches with insights from neo-Gricean pragmatics into the role of speaker's intentions in communication. She shows that (...) the compositionality of meaning may be understood as merger representations combining information from various sources including word meaning and sentence structure, various kinds of default interpretations, and conscious pragmatic inference. Among the applications the author discusses are constructions that pose problems in semantic analysis such as referring expressions, propositional attitude constructions, presupposition, modality, numerals, and sentential connectives. She proposes solutions to cutting edge problems in the semantics/pragmatics interface - for example, how many levels of meaning should be distinguished; the status of underspecification; how much contextual information should be placed in the representation of the speaker's meaning; whether there are default interpretations; the stage of utterance interpretation at which pragmatic inference begins; and whether compositionality is a necessary feature of the theory of meaning and if so how it is to be defined.The book is for students and researchers in semantics, pragmatics, computational linguistics, and philosophy of language at advanced undergraduate level and above. (shrink)

Relationship between default semantics and modularity of mind (in particular mind reading through the principle of Relevance).

This book is about beliefs, language, communication and cognition. It deals with the fundamental issue of the interpretation of the speaker's utterance expressing a belief and reporting on beliefs of other people in the form of oratio obliqua. The main aim of the book is to present a new account of the problem of interpreting utterances expressing beliefs and belief reports in terms of an approach called Default Semantics.

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

I show that a generalization of premise semantics allows for a new set of solutions to the problems posed by anankastic conditionals.

Dynamic approaches to semantics like Discourse Representation Theory or Jaszczolt's Default Semantics provide more and more effective tools to represent how speakers handle meanings in linguistic practices. These deeper perspectives may give us a lever to lift some of the philosophical perplexities crowding semantics and to catch a glimpse of what hides beneath them. In this paper, I exploit these approaches with relation to the analysis of belief reports. However, it will emerge that, despite their benefits, (...) the theories that support these representational advances may be themselves question begging from a philosophical point of view. Brandom's remarks about normative character of intentional content offer an important contribution to bring into focus the right path to drive these representational improvements towards really acceptable answers to philosophical questions about semantics. (shrink)

This book offers a semantic and metasemantic inquiry into the representation of meaning in linguistic interaction. Kasia Jaszczolt offers a new contextualist take on the semantics/pragmatics boundary, and argues that this is the only promising stance on meaning. This approach allows the selection of the cognitively plausible object of enquiry - namely the intended, primary meaning - and its adoption as a unit of semantic analysis despite the varying provenance of the contributing information. The analysis transcends the said/implicated distinction (...) and heavily relies on the dynamic construction of meaning in discourse, using truth conditions as a tool and at the same time conforming to pragmatic compositionality. Meaning in Linguistic Interaction builds on the author's earlier work on Default Semantics, and adds new arguments in favour of radical contextualism, particularly with regard to the role of salience, the dynamic nature of the unit that forms a basis of the interpretation process, and the flexibility of word meaning. It is illustrated with examples from a variety of languages and offers formal representations of meaning in the metalanguage of Default Semantics. (shrink)

Statistical Default Logic (SDL) is an expansion of classical (i.e., Reiter) default logic that allows us to model common inference patterns found in standard inferential statistics, e.g., hypothesis testing and the estimation of a population‘s mean, variance and proportions. This paper presents an embedding of an important subset of SDL theories, called literal statistical default theories, into stable model semantics. The embedding is designed to compute the signature set of literals that uniquely distinguishes each extension on (...) a statistical default theory at a pre-assigned error-bound probability. (shrink)

Language employs various coordinators to connect propositions, a subset of which are “logical” in nature and thus analogous to the truth operators of formal logic. We here focus on two linguistic connectives and their negations: conjunction _and_ and (inclusive) disjunction _or_. Linguistic connectives exhibit a truth-conditional component as part of their meaning (their semantics), but their use in context can give rise to various implicatures and presuppositions (the domain of pragmatics) as well as to inferences that go beyond semantic/pragmatic (...) properties (the result of reasoning processes). We provide a comprehensive review of the role of the logical connectives in language and argue that three sets of factors—semantic, pragmatic, and those related to reasoning—are separate and separable, though some details may differ cross-linguistically. As a way to showcase the argument, we present two experiments in language comprehension in Spanish wherein pragmatic content was minimised and reasoning processes neutered, thus potentially highlighting what might be the default meanings of the connectives under study. In Experiment 1 we show that the conjunctive reading of inclusive disjunction is available in positive contexts other than in syntactically intricate cases such as downward entailing and free choice contexts, contrary to what has been claimed in the literature. In Experiment 2 we show that negated conjunctions and disjunctions in Spanish can easily receive the same interpretation when contrasted against the same context and, moreover, that these interpretations match those available in English, despite claims from the literature that linguistic connectives and local negation interact differently in English and Romance languages. (shrink)

A coherence-based probability semantics for categorical syllogisms of Figure I, which have transitive structures, has been proposed recently (Gilio, Pfeifer, & Sanfilippo [15]). We extend this work by studying Figure II under coherence. Camestres is an example of a Figure II syllogism: from Every P is M and No S is M infer No S is P. We interpret these sentences by suitable conditional probability assessments. Since the probabilistic inference of ~????|???? from the premise set {????|????, ~????|????} is not (...) informative, we add ????(????|(????∨????))>0 as a probabilistic constraint (i.e., an “existential import assumption”) to obtain probabilistic informativeness. We show how to propagate the assigned (precise or interval-valued) probabilities to the sequence of conditional events (????|????,~????|????,????|(????∨????)) to the conclusion ~????|???? . Thereby, we give a probabilistic meaning to the other syllogisms of Figure II. Moreover, our semantics also allows for generalizing the traditional syllogisms to new ones involving generalized quantifiers (like Most S are P) and syllogisms in terms of defaults and negated defaults. (shrink)

We start with an observation about implicit quantifier domain restriction: certain implicit restrictions (e.g., restricting objects by location and time) appear to be more natural and widely available than others (e.g., restricting objects by color, aesthetic, or historical properties). Our aim is to explain why this is. That is, we aim to explain why some implicit domain restriction possibilities are available by default. We argue that, regardless of their other explanatory virtues, extant pragmatic and metasemantic frameworks leave this question (...) unanswered. We then motivate a partially nativist account of domain restriction that involves a minimal view of joint planning around broad shared goals about navigating and influencing our environments augmented with cognitive heuristics that facilitate these. Finally, we sketch how the view can be extended to account for the ways non-default restriction possibilities become available when conversationalists have shared idiosyncratic goals. (shrink)

A consistency default is a propositional inference rule that asserts the consistency of a formula in its consequence. Consistency defaults allow for a straightforward encoding of domains in which it is explicitely known when something is possible. The logic of consistency defaults can be seen as a variant of cumulative default logic or as a generalization of justified default logic; it is also able to simulate Reiter default logic in the seminormal case. A semantical characterization of (...) consistency defaults in terms of processes and in terms of a fixpoint equation is given, as well as a normal form. (shrink)

Since its inception, situation theory has been concerned with the situated nature of meaning and cognition, a theme which has also recently gained some prominence in Artificial Intelligence. Channel theory is a recently developed framework which builds on concepts introduced in situation theory, in an attempt to provide a general theory of information flow. In particular, the channel theoretic framework offers an account of fallible regularities, regularities which provide enough structure to an agent's environment to support efficient cognitive processing but (...) which are limited in their reliability to specific circumstances. This paper describes how this framework can lead to a different perspective on defeasible reasoning: rather than being seen as reasoning with incomplete information, an agent makes use of a situated regularity, choosing to use the regularity that seems best suited (trading off reliability and simplicity) to the circumstances it happens to find itself in. We present a formal model for this task, based on the channel theoretic framework, and sketch how the model may be used as the basis for a methodology of defeasible situated reasoning, whereby agents reason with simple monotonic regularities but may revise their choice of regularity on learning more about their circumstances. (shrink)

I identify and develop a solution to the puzzles of anankastic conditionals that is novel in the sense that it has gone largely unnoticed, but also well-worn in that the materials for it have long been available. The solution involves an integration of the classical Kratzerian premise semantics and a default theory of reasons (such as the one presented in Horty, 2012, leveraging several decades of research on default logic). To stress-test the proposal I also investigate how (...) it might be applied to the variety of anankastic-adjacent data discussed by Condoravdi and Lauer (2016). The resulting approach is not just an exceptional fit for the problem of anankastic conditionals, but also an independently promising upgrade on the classical account of modals. (shrink)

We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates a number of default-beliefs of object-level formulas. We extend this framework by proposing a mechanism to reflect these defaults down. Such a reflection is seen as essentially having a temporal flavour: defaults derived at (...) the meta-level are projected as facts in a next object level state. In this way, we obtain temporal models for default reasoning in meta-level formalisms which can be conceived as labeled branching trees. Thus, descending the tree corresponds to shifts in time that model downward reflection, whereas the branching of the tree corresponds to ways of combining possible defaults. All together, this yields an operational or procedural semantics of reasoning by default, which admits one to reason about it by means of branching-time temporal logic. Finally, we define sceptical and credulous entailment relations based on these temporal models and we characterize Reiter extensions in our semantics. (shrink)

Based on a close study of benchmark examples in default reasoning, such as Nixon Diamond, Penguin Principle, etc., this paper provides an in depth analysis of the basic features of default reasoning. We formalize default inferences based on Modus Ponens for Default Implication, and mark the distinction between "local inferences"(to infer a conclusion from a subset of given premises) and "global inferences"(to infer a conclusion from the entire set of given premises). These conceptual analyses are captured (...) by a formal semantics that is built upon the set-selection function technique. A minimal logic system M of default reasoning that accommodates Modus Ponens for Default Implication and suitable for local inferences is proposed, and its soundness is proved. (shrink)

A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.

When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this interpretation (...) yields a semantics for default logic based on temporal epistemic models. A comparison between the various semantics for default logic will show the differences and similarities of these approaches and ours. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the (...) nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

In this paper I examine a contemporary debate about the general notion of linguistic rules and the place of context in determining meaning, which has arisen in the wake of a challenge that the conceptual framework of moral particularism has brought to the table. My aim is to show that particularism in the theory of meaning yields an attractive model of linguistic competence that stands as a genuine alternative to other use-oriented but still generalist accounts that allow room for context-sensitivity (...) in deciding how the linguistic rules would apply in concrete cases. I argue that the ideas developed in relation to particularism in meta-ethics illuminate a difficulty with the modest generalist view, one that can be resolved by adopting semantic particularism instead. (shrink)

In recent work, Williamson has defended a suggestive account of assertion. Williamson claims that the following norm or rule (the knowledge rule) is constitutive of assertion, and individuates it: (KR) One must ((assert p) only if one knows p) Williamson is not directly concerned with the semantics of assertion-markers, although he assumes that his view has implications for such an undertaking; he says: “in natural languages, the default use of declarative sentences is to make assertions” (op. cit., 258). (...) In this paper I will explore Williamson’s view from this perspective, i.e., in the light of issues regarding the semantics of assertion-markers. I will end up propounding a slightly different account, on which, rather than KR, what is constitutive and individuating of assertion is an audience-involving transmission of knowledge rule: (TKR) One must ((assert p) only if one’s audience comes thereby to be in a position to know p) I will argue that TKR, of which KR is an illocutionary consequence (but not the other way around), has all the virtues that Williamson claims for his account and no new defect. (shrink)

Davidsonian event semantics is often taken to form an unhappy marriage with compositional semantics. For example, it has been claimed to be problematic for semantic accounts of quantification Proceedings of the 16th Amsterdam Colloquium, 2007), for classical accounts of negation Semantics and contextual expression, 1989), and for intersective accounts of verbal coordination. This paper shows that none of this is the case, once we abandon the idea that the event variable is bound at sentence level, and assume (...) instead that verbs denote existential quantifiers over events. Quantificational arguments can then be given a semantic account, negation can be treated classically, and coordination can be modeled as intersection. The framework presented here is a natural choice for researchers and fieldworkers who wish to sketch a semantic analysis of a language without being forced to make commitments about the hierarchical order of arguments, the argument-adjunct distinction, the default scope of quantifiers, or the nature of negation and coordination. (shrink)

The article addresses the problem of how semantic information can be upgraded to knowledge. The introductory section explains the technical terminology and the relevant background. Section 2 argues that, for semantic information to be upgraded to knowledge, it is necessary and sufficient to be embedded in a network of questions and answers that correctly accounts for it. Section 3 shows that an information flow network of type A fulfils such a requirement, by warranting that the erotetic deficit, characterising the target (...) semantic information t by default, is correctly satisfied by the information flow of correct answers provided by an informational source s. Section 4 illustrates some of the major advantages of such a Network Theory of Account (NTA) and clears the ground of a few potential difficulties. Section 5 clarifies why NTA and an informational analysis of knowledge, according to which knowledge is accounted semantic information, is not subject to Gettier-type counterexamples. A concluding section briefly summarises the results obtained. (shrink)

ABSTRACT Reiter's default logic is one of the most prominent and well-studied approaches to nonmonotonic reasoning. Its evolution has resulted in diverse variants enjoying many interesting properties. This process however seems to be diverging because it has led to default logics that are difficult to compare due to different formal characterizations—sometimes even dealing with different objects of discourse. This problem is addressed in this paper in two ways. One the one hand, we elaborate on the relationships between different (...) types of default logics and discuss their differences wrt some basic properties. In particular, we show how two recently proposed variants, namely rational and CA-default logic, are related to each other and existing default logics. As an interesting byproduct, we obtain a cumulative counterpart to Lukasiewicz' variant of default logic. The resulting system is insofar surprising since it necessitates to refine the canonical way of assuring cumulativity in default logics. On the other hand, we pursue an integrating approach. We give a translation embedding rational and CA-default logic into a recently developed framework for default logics. This allows us not only to classify these variants, but it moreover provides us with semantical underpinnings that have been lacking so far. (shrink)

This article advances the first semantics that is neither for nor against a default implicational link between the progressive and perfective forms, when it comes to solving the imperfective paradox. Depending on the doxastic context of its use, we contend that the progressive form sometimes allows and sometimes does not allow the inference of the corresponding simple form. In other words, the preparatory phase of an event might or might not be believed to lead to its culmination. Indeed, (...) the context can put constraints on beliefs about the time of the culmination and whether or not it allows this inference to be made. From a formal perspective, this new solution to the imperfective paradox combines a specific modal approach with an event-structure analysis originating in event semantics. Finally, this approach solves the associated difficulties that have plagued the most well-known theories in this field. (shrink)

Moeser suggested participants default to linear ordering elements but they can be primed to impose either linear or partial ordering. This study seems problematic insofar as ‘greater than’ might be understood to incline participants to favor linear orderings. Recent follow-up studies strongly suggest participants do not default to linear ordering. It seems plausible, moreover, that the observed priming effect is far more pervasive than Moeser countenanced. The present work explores the extent to which priming for linear or partial (...) orders conflicts with the construction of linear or partial ordering lists. Our two experiments suggest friction between priming and task, and also show once the priming tasks are cleared of potentially confounding semantic content, participants perform equally with respect to constructing linear or partial orders under similar priming conditions. (shrink)

This paper reports an experiment that investigates interpretive distinctions between two different expressions of generalization in Spanish. In particular, our aim was to find out when the distinction between generic statements (GS) such as Tigers have stripes and universally quantified statements (UQS) such as All tigers have stripes was acquired in Spanish-speaking children of two different age groups (4/5-year-olds and 8/9-year-olds), and then compare these results with those of adults. The starting point of this research was the semantic distinction between (...) GS and UQS in that the former admit exceptions, unlike the latter. On the other hand, several authors have observed a Generic overgeneralization effect (GOG) consisting in allowing for UQS to be felicitous in the face of exceptions, thus proposing that this “error” stems from GS being defaults (simpler, more easily learned and processed). In the current paper we aimed to test the “Generics as Default” (GaD) hypothesis by comparing GS and UQS in three different age ranges. Our data show that, overall, the accuracy of GS is greater than the accuracy of UQS. Moreover, we also confirm a hypothesized interaction between age and NP type (GS vs UQS). Further, we present several data points that are not predicted by the GaD, including an observed decline in the accuracy of GS in the older group of children as well as in adults, and that children fail at rejecting statements that are not considered to be true generalizations. (shrink)

Standard semantics of proper names assigns them the function of reference to individual things. This presupposes that to understand the meaning of a proper name is to understand what it denotes in the context of its referential use. But unambiguous identification of the referent of a proper name in its normal (referential) use looks like an unsolvable problem. Senses associated with referential uses of such names don't allow ascribing them singular referents in their contexts; and what concerns contexts themselves, (...) they either don't contain proper referents at all or contain more than one, thus being referentially ambiguous. Some philosophers of language believe that the main problem for the standard semantics of proper names is that they assign them referents of wrong kind: that these, for instance, should be rather abstract entities, i.e. sets, than individual things. In this paper I try to argue that the choice of an alternative semantics for proper names does not solve the main problem with their meanings, i.e. that of their referential ambiguity. On the one hand even in the most transparent contexts there is always available an alternative referent to be assigned to the proper name's use along with some standard or default one; the fact that we prefer some standard interpretation (when we actually do) over alternative ones reflects at best that certain semantic theories contribute more substantially to ordinary communication in comparison with others. This does not yet imply that they better explain meanings of proper names. On the other hand there is also no good explanation of a phenomenon of reference to a particular thing as such: we still don't understand how a name may become referring to one and the same particular thing in many different situations for many different agents of its use etc., and how the thing may literally become a bearer of a name. (shrink)

Most of the work in default logic is about default theories that are completely specified. In this category are the proposals of appropriate semantics for default logic, the characterizations of the complexity of reasoning with a default theory, the algorithms for finding consequences of default theories, etc. Relatively little attention has been paid to the process of building a default theory, and most of the work on this topic is about translating knowledge bases (...) from other formalisms (such as circumscription, autoepistemic logic, and action description languages) into default logic. This paper is about expressing knowledge in default logic. In particular, we assume that defaults are initially formulated as normal, and are then corrected using specific inference examples. (shrink)

In their target article, Wang and Busemeyer (2013) discuss question order effects in terms of incompatible projectors on a Hilbert space. In a similar vein, Blutner recently presented an orthoalgebraic query language essentially relying on dynamic update semantics. Here, I shall comment on some interesting analogies between the different variants of dynamic semantics and generalized quantum theory to illustrate other kinds of order effects in human cognition, such as belief revision, the resolution of anaphors, and default reasoning (...) that result from the crucial non-commutativity of mental operations upon the belief state of a cognitive agent. (shrink)

We present a coherence-based probability semantics for (categorical) Aristotelian syllogisms. For framing the Aristotelian syllogisms as probabilistic inferences, we interpret basic syllogistic sentence types A, E, I, O by suitable precise and imprecise conditional probability assessments. Then, we define validity of probabilistic inferences and probabilistic notions of the existential import which is required, for the validity of the syllogisms. Based on a generalization of de Finetti's fundamental theorem to conditional probability, we investigate the coherent probability propagation rules of argument (...) forms of the syllogistic Figures I, II, and III, respectively. These results allow to show, for all three Figures, that each traditionally valid syllogism is also valid in our coherence-based probability semantics. Moreover, we interpret the basic syllogistic sentence types by suitable defaults and negated defaults. Thereby, we build a knowledge bridge from our probability semantics of Aristotelian syllogisms to nonmonotonic reasoning. Finally, we show how the proposed semantics can be used to analyze syllogisms involving generalized quantifiers. (shrink)

Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute's defeasible logic. The semantics are based upon the well-founded semantics for logic programs. It is shown that the logics are sound with respect to their counterpart semantics and complete for locally finite theories. Unlike some other nonmonotonic reasoning formalisms such as Reiter's default logic, the two defeasible logics are directly skeptical and so reject floating conclusions. For defeasible theories with transitive priorities on defeasible (...) rules, the logics are shown to satisfy versions of Cut and Cautious Monotony. For theories with either conflict sets closed under strict rules or strict rules closed under transposition, a form of Consistency Preservation is shown to hold. The differences between the two logics and other variants of defeasible logic—specifically those presented by Billington, Antoniou, Governatori, and Maher—are discussed. (shrink)

By hypothesis, awareness is involved in the modulation of feedback from semantics to the lexical level in the visual word recognition system. When subjects are aware of the fact that there are many related prime–target pairs in a semantic priming experiment, this knowledge is used to configure the system to feed activation back from semantics to the lexical level so as to facilitate processing. When subjects are unaware of this fact, the default set is maintained in which (...) activation is not fed back from semantics to the lexical level so as to conserve limited resources. Qualitative differences in the pattern of data from two lexical decision experiments that employ masked priming are consistent with this hypothesis. Semantic context and stimulus quality interact when the prime is processed with awareness whereas these same two factors produce additive effects on RT when the prime is unlikely to have been processed with awareness. These experiments thus illustrate one way in which awareness affects the dynamics of visual word recognition. (shrink)

Adam Elga has presented an anti-thermodynamic process as a counterexample to Lewis’s default semantics for counterfactuals. The outstanding reaction of Jonathan Schaffer and Boris Kment is revisionary. It sacrifices Lewis’s aim of defining causation in terms of counterfactual dependence. Lewis himself suggested an alternative: «counter-entropic funnybusiness» should make for dissimilarity. But how is this alternative to be spelled out? I discuss a recent proposal: include special science laws, among them the laws of thermodynamics. Although the proposal fails, it (...) serves to uncover the limits of Elga’s example. (shrink)

Grice's distinction between what is said by a sentence and what is implicated by an utterance of it is both extremely familiar and almost universally accepted. However, in recent literature, the precise account he offered of implicature recovery has been questioned and alternative accounts have emerged. In this paper, I examine three such alternative accounts. My main aim is to show that the two most popular accounts in the current literature still face signifi cant problems. I will then conclude by (...) suggesting that an alternative account, emerging from semantic minimalism, is best placed to accommodate Grice's distinction. (shrink)

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default (...) reasoning in System . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)