Generating Schemata of Resolution Proofs

Two distinct algorithms are presented to extract (schemata of) resolution proofs from closed tableaux for propositional schemata. The first one handles the most efficient version of the tableau calculus but generates very complex derivations (denoted by rather elaborate rewrite systems). The second one has the advantage that much simpler systems can be obtained, however the considered proof procedure is less efficient

On predication, derivation and anti-locality

This paper pursues the question what the implications of the Anti-Locality Hypothesis could be for the syntax of secondary predication. Focus of the discussion will be an investigation of what their internal structure of small clause complements must look like, how these small clause complements connect to their matrix environments, and what the relevance could be for the formulation of anti-locality presented here. Anti-locality is defined over a tripartite clause structure (split into three Prolific Domains) and a PF-condition on the computation (the Condition on Domain-Exclusivity). The investigation revolves around two leading questions: (i) does the syntax of small clauses involve more structure than simply [SC DP XP] and (ii) do small clauses constitute their own Prolific Domain (or maybe even more)? The results, affirmative answers to both questions, are also relevant for other types of secondary predication

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL , in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established

A Bi-Polar Theory of Nominal and Clause Structure and Function

It is taken as axiomatic that grammar encodes meaning. Two key dimensions of meaning that get grammatically encoded are referential meaning and relational meaning. The key claim is that, in English, these two dimensions of meaning are typically encoded in distinct grammatical poles—a referential pole and a relational pole—with a specifier functioning as the locus of the referential pole and a head functioning as the locus of the relational pole. Specifiers and heads combine to form referring expressions corresponding to the syntactic notion of a maximal projection. Lexical items and expressions functioning as modifiers are preferentially attracted to one pole or the other. If the head of an expression describes a relation, one or more complements may be associated with the head. The four grammatical functions specifier, head, modifier and complement are generally adequate to represent much of the basic structure and function of nominals and clauses. These terms are borrowed from X-Bar Theory, but they are motivated on semantic grounds having to do with their grammatical function to encode referential and relational meaning