Extensional Collapse Situations I: non-termination and unrecoverable errors

We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined form a lattice when ordered by the extensional collapse situation relation, introduced in order to compare models with respect to the amount of "intensional information" that they provide on computation. The proofs are carried out by exhibiting suitable applied {\lambda}-calculi, and by exploiting the fundamental lemma of logical relations

Content and Meaning Constitutive Inferences

A priori theories of justification of logic based on meaning often lead to trouble, in particular to issues concerning circularity. First, I present Boghossian’s a prioriview. Boghossian maintains the rule-circular justifications from a conceptual role semantics. However, rule-circular justifications are problematic. Recently, Boghossian (Boghossian, 2015) has claimed that rules should be thought of as contents and contents as abstract objects. In this paper, I discuss Boghossian’s view. My argumentation consists of three main parts. First, I analyse several arguments to show that in fact, Boghossian’s inferentialist solution is not fully satisfying. Second, I discuss the matter further, if one accepts that basic logical rules are constitutive of meaning, that is, they constitute the logical concepts and the content of a rule is an abstract object, then abstract objects — like, for example, rules — could be constitutive of meaning. The question is whether conceptual priority is in the judgment or in the object and what theory of content is pursued. Grasping content as a matter of knowing how a word or concept behaves in inferences is not completely explicative. Finally, I contend that rules come to exist as a result of certain kinds of mental action. These actions function as constitutive norms. Logical rules are not abstract objects but ideal. What one construes as norms or rules of content may involve idealization, but this is because we share a language

Hyperfine-Grained Meanings in Classical Logic

This paper develops a semantics for a fragment of English that is based on the idea of `impossible possible worlds'. This idea has earlier been formulated by authors such as Montague, Cresswell, Hintikka, and Rantala, but the present set-up shows how it can be formalized in a completely unproblematic logic---the ordinary classical theory of types. The theory is put to use in an account of propositional attitudes that is `hyperfine-grained', i.e. that does not suffer from the well-known problems involved with replacing expressions by logical equivalents

Nominal Abstraction

Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via generic judgments. However, logics encompassing these two features do not currently allow for the definition of relations that embody dynamic aspects related to binding, a capability needed in many reasoning tasks. We propose a new relation between terms called nominal abstraction as a means for overcoming this deficiency. We incorporate nominal abstraction into a rich logic also including definitions, generic quantification, induction, and co-induction that we then prove to be consistent. We present examples to show that this logic can provide elegant treatments of binding contexts that appear in many proofs, such as those establishing properties of typing calculi and of arbitrarily cascading substitutions that play a role in reducibility arguments.Comment: To appear in the Journal of Information and Computatio

The accident of logical constants

Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language with the full expressive power of first-order logic with identity, I show that this is true of logic more generally. Furthermore, having, in a logical theory, non-trivial valid forms that do not involve logical terms is not merely a technical possibility. As the case of adverbs shows, issues about the range of argument forms logic should countenance can quite naturally arise in such a way that they do not turn on whether we countenance certain terms as logical