Cognition in moral space: A minimal model

We describe moral cognition as a process occurring in a distinctive cognitive space, wherein moral relationships are defined along several morally relevant dimensions. After identifying candidate dimensions, we show how moral judgments can emerge in this space directly from object perception, without any appeal to moral rules or abstract values. Our reductive “minimal model” (Batterman & Rice, 2014) elaborates Beal’s (2020) claim that moral cognition is determined, at the most basic level, by “ontological frames” defining subjects, objects, and the proper relation between them. We expand this claim into a set of formal hypotheses that predict moral judgments based on how objects are “framed” in the relevant dimensions of “moral space.”     

Chain-Arguments and the Sorites Paradox

A finite chain of valid arguments can never lead from truth to falsehood. Call this the concatenation principle, or CP. Some propose to reject CP in response to the sorites paradox. I offer a justification of a restricted version of CP based on intuitively-appealing principles, all of which are already assumed in mathematics. The restricted version excludes soritical cases, but covers intuitively correct applications of CP in mathematics and elsewhere. The upshot is that the cost of rejecting the unrestricted CP is much lower than is often assumed.     

Pure Extensions, Proof Rules, and Hybrid Axiomatics

In this paper we argue that hybrid logic is the deductive setting most natural for Kripke semantics. We do so by investigating hybrid axiomatics for a variety of systems, ranging from the basic hybrid language (a decidable system with the same complexity as orthodox propositional modal logic) to the strong Priorean language (which offers full first-order expressivity).We show that hybrid logic offers a genuinely first-order perspective on Kripke semantics: it is possible to define base logics which extend automatically to a wide variety of frame classes and to prove completeness using the Henkin method. In the weaker languages, this requires the use of non-orthodox rules. We discuss these rules in detail and prove non-eliminability and eliminability results. We also show how another type of rule, which reflects the structure of the strong Priorean language, can be employed to give an even wider coverage of frame classes. We show that this deductive apparatus gets progressively simpler as we work our way up the expressivity hierarchy, and conclude the paper by showing that the approach transfers to first-order hybrid logic.A preliminary version of this paper was presented at the fifth conference on Advances in Modal Logic (AiML 2004) in Manchester. We would like to thank Maarten Marx for his comments on an early draft and Agnieszka Kisielewska for help with the proof reading.Special Issue Ways of Worlds II. On Possible Worlds and Related Notions Edited by Vincent F. Hendricks and Stig Andur Pedersen     

Ontology, reduction, emergence: A general frame

In a scientific context, ontological commitments should be considered as supervenient over accepted scientific theories. This implies that the primarily ontological notions of reduction and emergence of entities of different kinds should be reformulated in terms of relations between existing empirical theories. For this, in turn, it is most convenient to employ a model-theoretic view of scientific theories: the identity criterion of a scientific theory is essentially given by a class of models. Accordingly, reduction and emergence are to be seen as particular kinds of relations between (some) models of different theories that subsume the same (or a similar) “experiential field”. The set-theoretical notion of an echelon-set proves to be crucial for this purpose: The domains in the models of the reduced theory are echelon-sets over the domains of the reducing theory. Finally, it is argued that emergence may plausibly be interpreted as akin to but weaker than reduction.     

Cut-Elimination and Quantification in Canonical Systems

Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to rules with unary quantifiers and show that it remains constructive. Then we provide semantics for such canonical systems using 2-valued non-deterministic matrices extended to languages with quantifiers, and prove that the following properties are equivalent for a canonical system G: (1) G admits Cut-Elimination, (2) G is coherent, and (3) G has a characteristic 2-valued non-deterministic matrix.     

Presumptions and the Distribution of Argumentative Burdens in Acts of Proposing and Accusing

This paper joins the voices warning against hasty transference of legal concepts of presumption to other kinds of argumentation, especially to deliberation about future acts and policies. Comparison of the pragmatics which respectively constitute the illocutionary acts of accusing and proposing reveals important differences in the ways presumptions prompt accusers and proposers to undertake probative responsibilities and, also, points to corresponding differences in their probative duties. This comparison has theoretically important implication regarding the norms governing persuasive argumentation. The paper is based on a broadly Gricean account of speech acts.     

Encoding Modal Logics in Logical Frameworks

We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed -calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when implemented in Proof Development Environments, such as Coq or LEGO.     

Burden of Proof Rules in Social Criticism

The article discusses burden of proof rules in social criticism. By social criticism I mean an argumentative situation in which an opponent publicly argues against certain social practices; the examples I consider are discrimination on the basis of species and discrimination on the basis of one's nationality. I argue that burden of proof rules assumed by those who defend discrimination are somewhat dubious. In social criticism, there are no shared values which would uncontroversially determine what is the reasonable presumption and who has the burden of proof, nor are there formal rules which would end the debate and determine the winner at a specific point.     

Correspondence Results for Relational Proof Systems with Application to the Lambek Calculus

We present a general framework for proof systems for relational theories. We discuss principles of the construction of deduction rules and correspondences reflecting relationships between semantics of relational logics and the rules of the respective proof systems. We illustrate the methods developed in the paper with examples relevant for the Lambek calculus and some of its extensions.