I develop a semantics for imperatives within the truthmaker framework by taking the meaning of an imperative to be given by the actions that are in compliance with or in contravention to the imperative.

This article develops the Pure Logic of Iterated Full Ground (plifg), a logic of ground that can deal with claims of the form “ϕ grounds that (ψ grounds θ)”—what we call iterated grounding claims. The core idea is that some truths Γ ground a truth ϕ when there is an explanatory argument (of a certain sort) from premisses Γ to conclusion ϕ. By developing a deductive system that distinguishes between explanatory and nonexplanatory arguments we can give introduction rules for operators for factive and nonfactive full ground, as well as for a propositional “identity” connective. Elimination rules are then found by using a proof-theoretic inversion principle.

Mathematicians prove theorems in a semi-formal setting, providing what we’ll call informal proofs. There are various philosophical reasons not to reduce informal provability to formal provability within some appropriate axiomatic theory (Leitgeb, 2009; Marfori, 2010; Tanswell, 2015), but the main worry is that we seem committed to all instances of the so-called reflection schema: B(φ) → φ (where B stands for the informal provability predicate). Yet, adding all its instances to any theory for which Löb’s theorem for B holds leads to inconsistency.

Currently existing approaches (Shapiro, 1985; Horsten, 1996, 1998) to formalizing the properties of informal provability avoid contradiction at a rather high price. They either drop one of the Hilbert-Bernays conditions for the provability predicate, or use a provability operator that cannot consistently be treated as a predicate.

Inspired by (Kripke, 1975), we investigate the strategy which changes the underlying logic and treats informal provability as a partial notion. We use non-deterministic matrices to develop a three-valued logic of informal provability, which avoids some of the above mentioned problems.

Logical universalism, a label that has been pinned on to Frege, involves the conflation of two features commonly ascribed to logic: universality and radicality. Logical universality consists in logic being about absolutely everything. Logical radicality, on the other hand, corresponds to there being the one and the same logic that any reasoning must comply with. The first part of this paper quickly remarks that Frege’s conception of logic makes logical universality prevail and does not preclude the admission of different contexts of discourse. The paper then aims to make it clear how Frege’s universalism can make sense of contextuality. Drawing on a suggestion made by Frege in his discussion of Hilbert, it shows that a properly Fregean notion of model can be devised. Taking up a suggestion from Wilfrid Hodges and William Demopoulos that the non-logical constants of a formal language can be compared to indexicals, this paper shows, pace Hodges and Demopoulos, that such an understanding of non-logical constants is not beyond Frege’s horizon. A formal framework, based on the modern tool of fibrations, is set out to explain and justify this point. This framework allows one to compare Frege and Tarski, by formalizing Frege’s suggestion and by presenting Tarski’s semantics in a generalized setting.

Stable logics are modal logics characterized by a class of frames closed under relation preserving images. These logics admit all filtrations. Since many basic modal systems such as K4 and S4 are not stable, we introduce the more general concept of an M-stable logic, where M is an arbitrary normal modal logic that admits some filtration. Of course, M can be chosen to be K4 or S4. We give several characterizations of M-stable logics. We prove that there are continuum many S4-stable logics and continuum many K4-stable logics between K4 and S4. We axiomatize K4-stable and S4-stable logics by means of stable formulas and discuss the connection between S4-stable logics and stable superintuitionistic logics. We conclude the article with many examples (and nonexamples) of stable, K4-stable, and S4-stable logics and provide their axiomatization in terms of stable rules and formulas.

To the memory of Prof. Grigori Mints, Stanford University

I extend the previously given truth-maker semantics and logic for imperatives to deontic statements.

In this article, I try to shed some new light on Grundgesetze §10, §29–§31 with special emphasis on Frege’s criteria and proof of referentiality and his treatment of the semantics of canonical value-range names. I begin by arguing against the claim, recently defended by several Frege scholars, that the first-order domain in Grundgesetze is restricted to value-ranges (including the truth-values), but conclude that there is an irresolvable tension in Frege’s view. The tension has a direct impact on the semantics of the concept-script, not least on the semantics of value-range names. I further argue that despite first appearances truth-value names (sentences) play a distinguished role as semantic “target names” for “test names” in the criteria of referentiality (§29) and do not figure themselves as “test names” regarding referentiality. Accordingly, I show in detail that Frege’s attempt to demonstrate that by virtue of his stipulations “regular” value-range names have indeed been endowed with a unique reference, can plausibly be regarded as a direct application of the context principle. In a subsequent section, I turn to some special issues involved in §10. §10 is closely intertwined with §31 and in my and Richard Heck’s view would have been better positioned between §30 and §31. In a first step, I discuss the piecemeal strategy which Frege applies when he attempts to bestow a unique reference on value-range names in §3, §10–§12. In a second step, I critically analyze his tentative, but predictably unsuccessful proposal (in a long footnote to §10) to identify all objects whatsoever, including those already clad in the garb of value-ranges, with their unit classes. In conclusion, I present two arguments for my claim that Frege’s identification of the True and the False with their unit classes in §10 is illicit even if both the permutation argument and the identifiability thesis that he states in §10 are regarded as formally sound. The first argument is set out from the point of view of the syntax of his formal language. It suggests though that a reorganization of the exposition of the concept-script would have solved at least one of the problems to which the twin stipulations in §10 give rise. The second argument rests on semantic considerations. If it is sound, it may call into question, if not undermine the legitimacy of the twin stipulations.

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic ${\cal D}$ and Propositional Independence Logic ${\cal I}$ are recently developed logical systems, based on team semantics, that provide a framework for such reasoning tasks. We introduce two new logics ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$, based on Kripke semantics, and propose them as alternatives for ${\cal D}$ and ${\cal I}$, respectively. We analyse the relative expressive powers of these four logics and discuss the way these systems relate to natural language. We argue that ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$ naturally resolve a range of interpretational problems that arise in ${\cal D}$ and ${\cal I}$. We also obtain sound and complete axiomatizations for ${{\cal L}_D}$ and ${{\cal L}_{\,I\,}}$.

The article investigates one of the key contributions to modern structural mathematics, namely Hilbert’s Foundations of Geometry (1899) and its mathematical roots in nineteenth-century projective geometry. A central innovation of Hilbert’s book was to provide semantically minded independence proofs for various fragments of Euclidean geometry, thereby contributing to the development of the model-theoretic point of view in logical theory. Though it is generally acknowledged that the development of model theory is intimately bound up with innovations in 19th century geometry (in particular, the development of non-Euclidean geometries), so far, little has been said about how exactly model-theoretic concepts grew out of methodological investigations within projective geometry. This article is supposed to fill this lacuna and investigates this geometrical prehistory of modern model theory, eventually leading up to Hilbert’s Foundations.

A one-premiss rule is said to be archetypal for a consequence relation when not only is the conclusion of any application of the rule a consequence (according to that relation) of the premiss, but whenever one formula has another as a consequence, these formulas are respectively equivalent to a premiss and a conclusion of some application of the rule. We are concerned here with the consequence relation of classical propositional logic and with the task of extending the above notion of archetypality to rules with more than one premiss, and providing an informative characterization of the set of rules falling under the more general notion.

The deviation of mathematical proof—proof in mathematical practice—from the ideal of formal proof—proof in formal logic—has led many philosophers of mathematics to reconsider the commonly accepted view according to which the notion of formal proof provides an accurate descriptive account of mathematical proof. This, in turn, has motivated a search for alternative accounts of mathematical proof purporting to be more faithful to the reality of mathematical practice. Yet, in order to develop and evaluate such alternative accounts, it appears as a necessary prerequisite to first possess a clear picture of what the deviation of mathematical proof from formal proof consists in. The present work aims to contribute building such a picture by investigating the relation between the elementary steps of deduction constituting the two types of proofs—mathematical inference and logical inference. Many claims have been made in the literature regarding the relation between mathematical inference and logical inference, most of them stating that the former is lacking properties that are constitutive of the latter. Such differentiating claims are, however, usually put forward without a clear conception of the properties occurring in them, and are generally considered to be immediately justified by our direct acquaintance, or phenomenological experience, with the two types of inferences. The present study purports to advance our understanding of the relation between mathematical inference and logical inference by developing a detailed philosophical analysis of the differentiating claims, that is, an analysis of the meaning of the differentiating claims—through the properties that occur in them—as well as the reasons that support them. To this end, we provide at the outset a representative list of the different properties of logical inference that have occurred in the differentiating claims, and we notice that they all boil down to the three properties of formality, generality, and mechanicality. For each one of these properties, our analysis proceeds in two steps: we first provide precise conceptual characterizations of the different ways logical inference has been said to be formal, general, and mechanical, in the philosophical and logical literature on formal proof; we then examine why mathematical inference does not appear to be formal, general, and mechanical, for the different variations of these notions identified. Our study results in a precise conceptual apparatus for expressing and discussing the properties differentiating mathematical inference from logical inference, and provides a first inventory of the various reasons supporting the observations of those differences. The differentiating claims constitute thus a set of data that any philosophical account of mathematical inference and proof purporting to be more faithful to mathematical practice ought to be able to accommodate and explain.

This article discusses how to update one’s credences based on evidence that has initial probability 0. I advance a diachronic norm, Kolmogorov Conditionalization, that governs credal reallocation in many such learning scenarios. The norm is based upon Kolmogorov’s theory of conditional probability. I prove a Dutch book theorem and converse Dutch book theorem for Kolmogorov Conditionalization. The two theorems establish Kolmogorov Conditionalization as the unique credal reallocation rule that avoids a sure loss in the relevant learning scenarios.

What is it to believe something might be the case? We develop a puzzle that creates difficulties for standard answers to this question. We go on to propose our own solution, which integrates a Bayesian approach to belief with a dynamic semantics for epistemic modals. After showing how our account solves the puzzle, we explore a surprising consequence: virtually all of our beliefs about what might be the case provide counterexamples to the view that rational belief is closed under logical implication.

We add propositional quantifiers to the propositional modal logic S4 and to the propositional intuitionistic logic H, introducing axiom schemes that are the natural analogs to axiom schemes typically used for first-order quantifiers in classical and intuitionistic logic. We show that the resulting logics are sound and complete for a topological semantics extending, in a natural way, the topological semantics for S4 and for H.

This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices like degrees of truth or supervaluation. Like epistemic approaches to vagueness, it may thus be smoothly integrated with the use of classical model theory as widely employed in natural language semantics. But unlike epistemicism, the described approach fails to imply either the existence of sharp boundaries or the failure of tolerance for soritical predicates. Applications of measurement theory (in the sense of Krantz, Luce, Suppes, & Tversky (1971)) to vagueness in the nonstandard setting are also explored.

We introduce the concept of a Zemanian logic above S4.3 and prove that an extension of S4.3 is the logic of a Tychonoff HED-space iff it is Zemanian.

The connection between the rules and derivations of Gentzen’s calculi NJ and LJ will be explained by several steps (i.e., systems), and an analysis of the well-known problems of the connection between reduction steps of normalization and cut elimination, from Zucker (1974) and Urban (2014), will be given.

We relate Popper functions to regular and perfectly additive such non-Archimedean probability functions by means of a representation theorem: every such non-Archimedean probability function is infinitesimally close to some Popper function, and vice versa. We also show that regular and perfectly additive non-Archimedean probability functions can be given a lexicographic representation. Thus Popper functions, a specific kind of non-Archimedean probability functions, and lexicographic probability functions triangulate to the same place: they are in a good sense interchangeable.

The logic of Conditional Beliefs (CDL) has been introduced by Board, Baltag, and Smets to reason about knowledge and revisable beliefs in a multi-agent setting. In this article both the semantics and the proof theory for this logic are studied. First, a natural semantics for CDL is defined in terms of neighbourhood models, a multi-agent generalisation of Lewis’ spheres models, and it is shown that the axiomatization of CDL is sound and complete with respect to this semantics. Second, it is shown that the neighbourhood semantics is equivalent to the original one defined in terms of plausibility models, by means of a direct correspondence between the two types of models. On the basis of neighbourhood semantics, a labelled sequent calculus for CDL is obtained. The calculus has strong proof-theoretic properties, in particular admissibility of contraction and cut, and it provides a decision procedure for the logic. Furthermore, its semantic completeness is used to obtain a constructive proof of the finite model property of the logic. Finally, it is shown that other doxastic operators can be easily captured within neighbourhood semantics. This fact provides further evidence of the naturalness of neighbourhood semantics for the analysis of epistemic/doxastic notions.