I develop and defend a truthmaker semantics for the relevant logic R. The approach begins with a simple philosophical idea and develops it in various directions, so as to build a technically adequate relevant semantics. The central philosophical idea is that truths are true in virtue of specific states. Developing the idea formally results in a semantics on which truthmakers are relevant to what they make true. A very natural notion of conditionality is added, giving us relevant implication. I (...) then investigate ways to add conjunction, disjunction, and negation; and I discuss how to justify contraposition and excluded middle within a truthmaker semantics. (shrink)

In this paper I will develop a view about the semantics of imperatives, which I term Modal Noncognitivism, on which imperatives might be said to have truth conditions (dispositionally, anyway), but on which it does not make sense to see them as expressing propositions (hence does not make sense to ascribe to them truth or falsity). This view stands against “Cognitivist” accounts of the semantics of imperatives, on which imperatives are claimed to express propositions, which are then enlisted in explanations (...) of the relevant logico-semantic phenomena. It also stands against the major competitors to Cognitivist accounts—all of which are non-truth-conditional and, as a result, fail to provide satisfying explanations of the fundamental semantic characteristics of imperatives (or so I argue). The view of imperatives I defend here improves on various treatments of imperatives on the market in giving an empirically and theoretically adequate account of their semantics and logic. It yields explanations of a wide range of semantic and logical phenomena about imperatives—explanations that are, I argue, at least as satisfying as the sorts of explanations of semantic and logical phenomena familiar from truth-conditional semantics. But it accomplishes this while defending the notion—which is, I argue, substantially correct—that imperatives could not have propositions, or truth conditions, as their meanings. (shrink)

Many philosophers take purportedly logical cases of ground ) to be obvious cases, and indeed such cases have been used to motivate the existence of and importance of ground. I argue against this. I do so by motivating two kinds of semantic determination relations. Intuitions of logical ground track these semantic relations. Moreover, our knowledge of semantics for first order logic can explain why we have such intuitions. And, I argue, neither semantic relation can be a (...) species of ground even on a quite broad conception of what ground is. Hence, without a positive argument for taking so-called ‘logical ground’ to be something distinct from a semantic determination relation, we should cease treating logical cases as cases of ground. (shrink)

A picture of the world as chiefly one of discrete objects, distributed in space and time, has sometimes seemed compelling. It is however one of the main targets of Henry Laycock's book; for it is seriously incomplete. The picture, he argues, leaves no space for "stuff" like air and water. With discrete objects, we may always ask "how many?," but with stuff the question has to be "how much?" Laycock's fascinating exploration also addresses key logical and linguistic questions about the (...) way we categorize the many and the much. (shrink)

Epistemic two-dimensional semantics is a theory in the philosophy of language that provides an account of meaning which is sensitive to the distinction between necessity and apriority. While this theory is usually presented in an informal manner, I take some steps in formalizing it in this paper. To do so, I define a semantics for a propositional modal logic with operators for the modalities of necessity, actuality, and apriority that captures the relevant ideas of epistemic two-dimensional semantics. I also (...) describe some properties of the logic that are interesting from a philosophical perspective, and apply it to the so-called nesting problem. (shrink)

In recent years, there has been a growing interest in truthmaker semantics as a framework for understanding a range of phenomena in philosophy and linguistics. Despite this interest, there has been limited study of the various logics that arise from the semantics. This paper aims to address this gap by exploring numerous ‘truthmaker logics’ and proving their compactness and decidability. This is in continuation with the inquiry of Fine and Jago (2019), who proved compactness and decidability for a particular kind (...) of truthmaker logic. The key results going into this are (1) ‘standard translations’ into first-order logic; (2) a truthmaker analogue of the finite model property; and (3) a proof showing that truthmaker consequence on semilattices coincides with truthmaker consequence on complete lattices. Finally, the connection with modal logic is examined. Specifically, it is illustrated how endowing truthmaker semantics with classical negation results in modal information logics. (shrink)

Philosophers have spilled a lot of ink over the past few years exploring the nature and significance of grounding. Kit Fine has made several seminal contributions to this discussion, including an exact treatment of the formal features of grounding [Fine, 2012a]. He has specified a language in which grounding claims may be expressed, proposed a system of axioms which capture the relevant formal features, and offered a semantics which interprets the language. Unfortunately, the semantics Fine offers faces a number of (...) problems. In this paper, I review the problems and offer an alternative that avoids them. I offer a semantics for the pure logic of ground that is motivated by ideas already present in the grounding literature, and for which a natural axiomatization capturing central formal features of grounding is sound and complete. I also show how the semantics I offer avoids the problems faced by Fine’s semantics. (shrink)

This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.

An important problem with machine learning is that when label number n>2, it is very difficult to construct and optimize a group of learning functions, and we wish that optimized learning functions are still useful when prior distribution P(x) (where x is an instance) is changed. To resolve this problem, the semantic information G theory, Logical Bayesian Inference (LBI), and a group of Channel Matching (CM) algorithms together form a systematic solution. MultilabelMultilabel A semantic channel in the G (...) theory consists of a group of truth functions or membership functions. In comparison with likelihood functions, Bayesian posteriors, and Logistic functions used by popular methods, membership functions can be more conveniently used as learning functions without the above problem. In Logical Bayesian Inference (LBI), every label’s learning is independent. For Multilabel learning, we can directly obtain a group of optimized membership functions from a big enough sample with labels, without preparing different samples for different labels. A group of Channel Matching (CM) algorithms are developed for machine learning. For the Maximum Mutual Information (MMI) classification of three classes with Gaussian distributions on a two-dimensional feature space, 2-3 iterations can make mutual information between three classes and three labels surpass 99% of the MMI for most initial partitions. For mixture models, the Expectation-Maxmization (EM) algorithm is improved and becomes the CM-EM algorithm, which can outperform the EM algorithm when mixture ratios are imbalanced, or local convergence exists. The CM iteration algorithm needs to combine neural networks for MMI classifications on high-dimensional feature spaces. LBI needs further studies for the unification of statistics and logic. (shrink)

The logicality of language is the hypothesis that the language system has access to a ‘natural’ logic that can identify and filter out as unacceptable expressions that have trivial meanings—that is, that are true/false in all possible worlds or situations in which they are defined. This hypothesis helps explain otherwise puzzling patterns concerning the distribution of various functional terms and phrases. Despite its promise, logicality vastly over-generates unacceptability assignments. Most solutions to this problem rest on specific stipulations about the (...) properties of logical form—roughly, the level of linguistic representation which feeds into the interpretation procedures—and have substantial implications for traditional philosophical disputes about the nature of language. Specifically, contextualism and semantic minimalism, construed as competing hypotheses about the nature and degree of context-sensitivity at the level of logical form, suggest different approaches to the over-generation problem. In this paper, I explore the implications of pairing logicality with various forms of contextualism and semantic minimalism. I argue that to adequately solve the over-generation problem, logicality should be implemented in a constrained contextualist framework. (shrink)

According to Jago (2014a), logical omniscience is really part of a deeper paradox. Jago develops an epistemic logic with principles of indeterminate closure to solve this paradox, but his official semantics is difficult to navigate, it is motivated in part by substantive metaphysics, and the logic is not axiomatized. In this paper, I simplify this epistemic logic by adapting the hyperintensional semantic framework of Sedlár (2021). My first goal is metaphysical neutrality. The solution to the epistemic (...) paradox should not require appeal to a metaphysics of truth-makers, situations, or impossible worlds, by contrast with Jago’s official semantics. My second goal is to elaborate on the proof theory. I show how to axiomatize a family of logics with principles of indeterminate epistemic closure. (shrink)

This paper establishes a sound and complete semantics for the impure logic of ground. Fine (Review of Symbolic Logic, 5(1), 1–25, 2012a) sets out a system for the pure logic of ground, one in which the formulas between which ground-theoretic claims hold have no internal logical complexity; and it provides a sound and complete semantics for the system. Fine (2012b) [§§6-8] sets out a system for an impure logic of ground, one that extends the rules of (...) the original pure system with rules for the truth-functional connectives, the first-order quantifiers, and λ-abstraction. However, no semantics has yet been provided for this system. The present paper partly fills this lacuna by providing a sound and complete semantics for a system GG containing the truth-functional operators that is closely related to the truth-functional part of the system of Fine (2012b). (shrink)

In this paper we present a characterization of hyper-connexivity by means of a relating semantics for Boolean connexive logics. We also show that the minimal Boolean connexive logic is Abelardian, strongly consistent, Kapsner strong and antiparadox. We give an example showing that the minimal Boolean connexive logic is not simplificative. This shows that the minimal Boolean connexive logic is not totally connexive.

In this paper the propositional logic LTop is introduced, as an extension of classical propositional logic by adding a paraconsistent negation. This logic has a very natural interpretation in terms of topological models. The logic LTop is nothing more than an alternative presentation of modal logic S4, but in the language of a paraconsistent logic. Moreover, LTop is a logic of formal inconsistency in which the consistency and inconsistency operators have a nice topological (...) interpretation. This constitutes a new proof of S4 as being "the logic of topological spaces", but now under the perspective of paraconsistency. (shrink)

The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case of QmbC, (...) the simpler quantified LFI expanding classical logic, will be analyzed in detail. An axiomatic extension of QmbC called QLFI1o is also studied, which is equivalent to the quantified version of da Costa and D'Ottaviano 3-valued logic J3. The semantical structures for this logic turn out to be Tarkian structures based on twist structures. The expansion of QmbC and QLFI1o with a standard equality predicate is also considered. (shrink)

Here's the thing: when you look at it from just the right angle, it's entirely obvious how semantics for second-order relevant logics ought to go. Or at least, if you've understood how semantics for first-order relevant logics ought to go, there are perspectives like this. What's more is that from any such angle, the metatheory that needs doing can be summed up in one line: everything is just as in the first-order case, but with more indices. Of course, it's no (...) small matter finding the magical angle from which everything becomes obvious. And even having found this perspective, one cannot assume one's audience will find things as obvious as oneself. All that to say this: if the results in the paper below strike you as obvious, pay attention to the perspective that makes that possible. And if they don't, feel free to ignore this preamble in its entirety. (shrink)

Type-logical semantics studies linguistic meaning with the help of the theory of types. The latter originated with Russell as an answer to the paradoxes, but has the additional virtue that it is very close to ordinary language. In fact, type theory is so much more similar to language than predicate logic is, that adopting it as a vehicle of representation can overcome the mismatches between grammatical form and predicate logical form that were observed by Frege and Russell. The grammatical (...) forms of ordinary language sentences consequently may be taken to be much less misleading than logicians in the first half of the 20th century often thought them to be. This was realized by Richard Montague, who used the theory of types to translate fragments of ordinary language into a logical language. Semantics is commonly divided into lexical semantics, which studies the meaning of words, and compositional semantics, which studies the way in which complex phrases obtain a meaning from their constituents. The strength of type-logical semantics lies with the latter, but type-logical theories can be combined with many competing hypotheses about lexical meaning, provided these hypotheses are expressed using the language of type theory. (shrink)

We explore some possibilities for developing epistemic logic using truthmaker semantics. We identify three possible targets of analysis for the epistemic logician. We then list some candidate epistemic principles and review the arguments that render some controversial. We then present the classic Hintikkan approach to epistemic logic and note—as per the ‘problem of logical omniscience’—that it validates all of the aforementioned principles, controversial or otherwise. We then lay out a truthmaker framework in the style of Kit Fine and (...) present six different ways of extending this semantics with a conditional knowledge operator, drawing on notions of implication and content that are prominent in Fine’s work. We demonstrate that different logics are thereby generated, bearing on the aforementioned epistemic principles. Finally, we offer preliminary observations about the prospects for each logic. (shrink)

In this paper, we provide a semantics for a range of positive substructural logics, including both logics with and logics without modal connectives. The semantics is novel insofar as it is meant to explicitly capture the computational flavor of these logics, and to do so in a way that builds in both nondeterministic and nonconcurrent computational processes.

There is a curious bifurcation in the literature on ground and its logic. On the one hand, there has been a great deal of work that presumes that logical complexity invariably yields grounding. So, for instance, it is widely presumed that any fact stated by a true conjunction is grounded in those stated by its conjuncts, that any fact stated by a true disjunction is grounded in that stated by any of its true disjuncts, and that any fact stated (...) by a true double negation is grounded in that stated by the doubly-negated formula. This commitment is encapsulated in the system GG axiomatized and semantically characterized by [deRosset and Fine, 2023] (following [Fine, 2012]). On the other hand, there has been a great deal of important formal work on “flatter” theories of ground, yielding logics very different from GG [Correia, 2010] [Fine, 2016, 2017b]. For instance, these theories identify the fact stated by a self-conjunction $$(\phi \wedge \phi )$$ with that stated by its conjunct $$\phi $$. Since, in these systems, no fact grounds itself, the “flatter” theories are inconsistent with the principles of GG. This bifurcation raises the question of whether there is a single notion of ground suited to fulfill the philosophical ambitions of grounding enthusiasts. There is, at present, no unified semantic framework employing a single conception of ground for simultaneously characterizing both GG and the “flatter” approaches. This paper fills this gap by specifying such a framework and demonstrating its adequacy. (shrink)

Implicational tonoid logics and their extensions with abstract Galois properties have been introduced by Yang and Dunn. They introduced matrix semantics for the implicational tonoid logics but did not do for the extensions. Here we provide such semantics for implicational partial gaggle logics as one sort of such extensions. To this end, first we discuss implicational partial gaggle logics in Hilbert-style. We next introduce one kind of matrix semantics based on Lindenbaum– Tarski matrices for the logics and show that those (...) logics are complete with respect to the matrix semantics. Finally, we further introduce a slightly different kind of matrix semantics based on reduced models for the logics and show that those logics are complete with respect to this matrix semantics. (shrink)

Semantic relativism is the view that the truth-value of some types of statements can vary depending on factors besides possible worlds and times, without any change in their propositional content. It has grown increasingly popular as a semantic theory of several types of statements, including statements that attribute knowledge of a proposition to a subject (knowledge attributions). The ways of knowing claim is the view that perception logically implies knowledge. In my “Semantic Relativism and Ways of Knowing” (...) (2019) I argued that a relativist semantics for knowledge attributions is incompatible with the ways of knowing claim. I suggested that this incompatibility depends on some basic features of the logic of relativist semantics, and therefore can be shown to generalise beyond the discussion of knowledge attributions to semantic relativism more broadly. Here I make this generalisation. I demonstrate that for any proposition p expressed by a statement that does not have a relativist semantics, and for any proposition q expressed by a statement that does have a relativist semantics, p fails to logically imply q. I explain why this happens, discuss some of its philosophical consequences, and consider a way to modify relativist semantics to avoid it. I conclude that semantic relativism raises interesting philosophical questions that have gone largely unnoticed in discussions of this view until now. (shrink)

In 1988, J. Ivlev proposed some (non-normal) modal systems which are semantically characterized by four-valued non-deterministic matrices in the sense of A. Avron and I. Lev. Swap structures are multialgebras (a.k.a. hyperalgebras) of a special kind, which were introduced in 2016 by W. Carnielli and M. Coniglio in order to give a non-deterministic semantical account for several paraconsistent logics known as logics of formal inconsistency, which are not algebraizable by means of the standard techniques. Each swap structure induces naturally a (...) non-deterministic matrix. The aim of this paper is to obtain a swap structures semantics for some Ivlev-like modal systems proposed in 2015 by M. Coniglio, L. Fariñas del Cerro and N. Peron. Completeness results will be stated by means of the notion of Lindenbaum–Tarski swap structures, which constitute a natural generalization to multialgebras of the concept of Lindenbaum–Tarski algebras. (shrink)

A truthmaker for a proposition P is exact if it contains nothing irrelevant to P. What are the exact truthmakers for necessitated propositions? This paper makes progress on this issue by showing how to extend Fine’s truthmaker semantics for intuitionistic logic to an exact truthmaker semantics for intuitionistic modal logic. The project is of interest also to the classical logician: while all distinctively classical theorems may be true, they differ from the intuitionistic ones in how they are made (...) true. This sheds new light on the status of the T and B axioms. (shrink)

We intoduce a novel extension of Description Logics (DLs) of typicality by means of probabilities able to represent and reason about typical properties and defeasible inheritance in DLs.

This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled (...) calculi, such as completeness, invertibility of rules and cut admissibility. Since labelled calculi are easily obtained via a logic’s semantics, the method presented in this paper can be seen as one whereby refined versions of labelled calculi (containing nested calculi as fragments) with favourable properties are derived directly from a logic’s semantics. (shrink)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow (...) double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)

Double negations are easily recognised in both the so-called “negative literature” and the original texts of some important scientific theories. Often they are not equivalent to the corresponding affirmative propositions. In the case the law of double negation fails they belong to non-classical logic, as first, intuitionist logic. Through a comparative analysis of the theories including them the main features of a new kind of theoretical organization governed by intuitionist logic are obtained. Its arguing proceeds through doubly (...) negated propositions and ad absurdum arguments. Then, the final doubly negated predicate is translated in the corresponding affirmative one, from which all the consequences are deduced in order to test them against reality. According to this model the true formalization of intuitionist logic is Kolmogorov’s 1932 paper. The above analysis also shows that modal words play an auxiliary or substitutive role to intuitionist propositions. In addition, it is shown that Vasiliev’s paraconsistent logic is represented through doubly negated propositions. By means of these three kinds of logic one can attribute a specific kind of logic to each of the three distinct steps of the process of building a scientific theory from the experimental data to its final theoretical system. It is also shown that the definition of negation is of a structural kind, rather than of an objective kind or a subjective kind: it has to be referred to the organization of the theory to which it belongs. (shrink)

This book presents a philosophical conception of logic -- "logical expressivism"-- according to which the role of logic is to make explicit reason relations, which are often neither monotonic nor transitive. It reveals new perspectives on inferential roles, sequent calculi, representation, truthmakers, and many extant logical theories.

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

In this paper I discuss a prevailing view by which logical terms determine forms of sentences and arguments and therefore the logical validity of arguments. This view is common to those who hold that there is a principled distinction between logical and nonlogical terms and those holding relativistic accounts. I adopt the Tarskian tradition by which logical validity is determined by form, but reject the centrality of logical terms. I propose an alternative framework for logic where logical terms no (...) longer play a distinctive role. This account employs a new notion of semantic. (shrink)

We argue that logical semantics might have faltered due to its failure in distinguishing between two fundamentally very different types of concepts: ontological concepts, that should be types in a strongly-typed ontology, and logical concepts, that are predicates corresponding to properties of and relations between objects of various ontological types. We will then show that accounting for these differences amounts to the integration of lexical and compositional semantics in one coherent framework, and to an embedding in our logical semantics of (...) a strongly-typed ontology that reflects our commonsense view of the world and the way we talk about it in ordinary language. We will show that in such a framework a number of challenges in natural language semantics can be adequately and systematically treated. (shrink)

The purpose of the present paper is to provide a way of understanding systems of logic of essence by introducing a new semantic framework for them. Three central results are achieved: first, the now standard Fitting semantics for the propositional logic of evidence is adapted in order to provide a new, simplified semantics for the propositional logic of essence; secondly, we show how it is possible to construe the concept of necessary truth explicitly by using the (...) concept of essential truth; finally, Fitting semantics is adapted in order to present a simplified semantics for the quantified logic of essence. (shrink)

Dugundji proved in 1940 that most parts of standard modal systems cannot be characterized by a single finite deterministic matrix. In the eighties, Ivlev proposed a semantics of four-valued non-deterministic matrices (which he called quasi-matrices), in order to characterize a hierarchy of weak modal logics without the necessitation rule. In a previous paper, we extended some systems of Ivlev’s hierarchy, also proposing weaker six-valued systems in which the (T) axiom was replaced by the deontic (D) axiom. In this paper, we (...) propose even weaker systems, by eliminating both axioms, which are characterized by eight-valued non-deterministic matrices. In addition, we prove completeness for those new systems. It is natural to ask if a characterization by finite ordinary (deterministic) logical matrices would be possible for all those Ivlev-like systems. We will show that finite deterministic matrices do not characterize any of them. (shrink)

This volume brings together new work on the logic and ontology of plurality and a range of recent articles exploring novel applications to natural language semantics. The contributions in this volume in particular investigate and extend new perspectives presented by plural logic and non-standard mereology and explore their applications to a range of natural language phenomena. Contributions by P. Aquaviva, A. Arapinis, M. Carrara, P. McKay, F. Moltmann, O. Linnebo, A. Oliver and T. Smiley, T. Scaltsas, P. Simons, (...) and B.-Y. Yi . (shrink)

In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, (...) KT , K4, and S4, with □ as the primary modal operator. We establish appropriate soundness and completeness theorems and establish the duality between □ and a natural presentation of ♢. We also show that our semantics is in its current form not complete with respect to euclidean modal logics. Our formulation makes essential use of relational structures on bases. (shrink)

Truth is undefined for imperative statements. However, if imperatives implicitly reference a fact, they can be rephrased as truth­-valuable declaratives explicitly referencing that fact. But are there such facts? Kenny held that any imperative references a set of wishes held by its imperator. I extend his thesis by proposing that imperator wishes are facts implicitly referenced by imperatives and explicitly referencing them yields semantically isomorphic declaratives. I implement this thesis with modal operators for wants and cause with which declarative schemata (...) are formed to automate translation of imperatives into semantically isomorphic declaratives called proxy-­imperatives. The proxy-­imperatives match imperative behavior and provide semantic validation of imperative arguments thereby integrating imperative reasoning into classic truth­-valuable logic. (shrink)

It’s widely accepted that normativity is not subject to truth values. The underlying reasoning is that truth values can only be predicated of descriptive statements; normative statements are prescriptive, not descriptive; thus truth value predicates cannot be assigned to normative statements. Hence, deonticity lacks logical semantics. This semantic monism has been challenged over the last decades from a series of perspectives that open the way for legal logics with imperative semantics. In the present paper I will go back to (...) Kant and review his understanding of practical judgments, presenting it as supported by a pluralistic semantics. From this perspective a norm of Law is a logical expression that includes as content a generic description of a possible behavior by a generality of juridical agents, and assigns to that content the assertion of its obligatory character, accompanied by a disincentive for non-compliance. From this perspective legal norms can be syntactically formalized and assigned appropriate semantic values in such terms that they can be incorporated into valid inferential schemes. The consequence is that we can put together legal logics that handle both the phenomenal and the deontic dimensions of legality. (shrink)

In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics from an (...) ontological perspective. In the rest of the paper, I develop rigorously and put into practice such a method, especially concerning the interpretation of second-order quantification. I will define the notion of ontological framework: it is a set-theoretical structure from which one can construct semantics whose ontological commitments correspond exactly to a given ontological view. I will define five ontological frameworks corresponding respectively to: (i) predicate nominalism, (ii) resemblance nominalism, (iii) armstrongian realism, (iv) platonic realism, and (v) tropism. From those different frameworks, I will construct different semantics for first-order and second-order languages. Notably I will present different kinds of nominalist semantics for second-order languages, showing thus that we can perfectly quantify over properties and relations while being ontologically committed only to individuals. I will show in what extent those semantics differ from each other; it will make clear how the disagreements between the ontological views extend from ontology to logic, and thus why endorsing an ontological view should have an impact on the kind of logic one should use. (shrink)

Kripke frames (and models) provide a suitable semantics for sub-classical logics; for example, intuitionistic logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and the basic logic (of Visser) axiomatizes transitive Kripke frames (with persistent satisfaction relations). Here, we investigate whether Kripke frames/models could provide a semantics for fuzzy logics. For each axiom of the basic fuzzy logic, necessary and sufficient conditions are sought for Kripke frames/models which satisfy them. It (...) turns out that the only fuzzy logics (logics containing the basic fuzzy logic) which are sound and complete with respect to a class of Kripke frames/models are the extensions of the Gödel logic (or the super-intuitionistic logic of Dummett); indeed this logic is sound and strongly complete with respect to reflexive, transitive and connected (linear) Kripke frames (with persistent satisfaction relations). This provides a semantic characterization for the Gödel logic among (propositional) fuzzy logics. (shrink)

The paper describes the solution to semantic paradoxes pioneered by Pavel Tichý and further developed by the present author. Its main feature is an examination (and then refutation) of the hidden premise of paradoxes that the paradox-producing expression really means what it seems to mean. Semantic concepts are explicated as relative to language, thus also language is explicated. The so-called ‘explicit approach’ easily treats paradoxes in which language is explicitly referred to. The residual paradoxes are solved by the (...) ‘implicit approach’ which employs ideas made explicit by the former one. (shrink)

This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, and the (...) modal operators regimenting the notion of 'intuition-that'. I argue that intuition-that can further be shown to entrain conceptual elucidation, by way of figuring as a dynamic-interpretational modality which induces the reinterpretation of both domains of quantification and the intensions and hyperintensions of mathematical concepts that are formalizable in monadic first- and second-order formal languages. Hyperintensionality is countenanced via a topic-sensitive epistemic two-dimensional truthmaker semantics. (shrink)

In the following the details of a state-of-affairs semantics for positive free logic are worked out, based on the models of common inner domain - outer domain semantics. Lambert's PFL system is proven to be weakly adequate (i.e., sound and complete) with respect to that semantics by demonstrating that the concept of logical truth definable therein coincides with that one of common truth-value semantics for PFL. Furthermore, this state-of-affairs semantics resists the challenges stemming from the slingshot argument since logically (...) equivalent statements do not always have the same extension according to it. Finally, it is argued that in such a semantics all statements of a certain language for PFL are state-of-affairs-related extensional as well as salva extensione extensional, even though their salva veritate extensionality fails. (shrink)

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and structured (...) objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)

Possible worlds are commonly seen as an interpretation of modal operators such as "possible" and "necessary". Here, we develop possible world semantics (PWS) which can be expressed in basic set theory and first-order logic, thus offering a reductionist account of modality. Specifically, worlds are understood as complete sets of statements and possible worlds are sets whose statements are consistent with a set of conceptual laws. We introduce the construction calculus (CC), a set of axioms and rules for truth, possibility, (...) worldness and consistency. We show that CC allows to prove fundamental theorems about necessity, possibility, impossibility and contigency, thus demonstrating prima-facie plausibility of PWS. Finally, we discuss the explanatory power of our approach and draw connections between our account and established philosophical conceptions of possible worlds. (shrink)

Logical monism is the view that there is ‘One True Logic’. This is the default position, against which pluralists react. If there were not ‘One True Logic’, it is hard to see how there could be one true theory of anything. A theory is closed under a logic! But what is logical monism? In this article, I consider semantic, logical, modal, scientific, and metaphysical proposals. I argue that, on no ‘factualist’ analysis (according to which ‘there is (...) One True Logic’ expresses a factual claim, rather than an attitude like approval), does the doctrine have both metaphysical and methodological import. Metaphysically, logics abound. Methodologically, what to infer from what is not settled by the facts, even the normative ones. I conclude that the only interesting sense in which there could be One True Logic is noncognitive. The same may be true of monism about normative areas, like moral, epistemic, and prudential ones, generally. (shrink)

This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from (...) its associated labelled calculus. (shrink)