1. Introduction. The purpose of this paper is to present a theory of in-ductive inference and rational acceptance in scientific inquiry. A concept of relevant deduction is defined in which the truth of each and every premise of a deductive argument is essential to establishing the truth of the conclusion by deduction from the premises. This definition is based on the completely abstract notion ...

The present paper consists in a reconstruction of the notions recognition Schiller’s Letter on Aesthetic Education, Schelling’s New Deduction Natural Law and Fichte’s Foundations Law. focusses logical dynamics these authors employ when they explain interaction between intersubjectivity subjectivity meaning concept freedom acquires each account recognition.

ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. It offers a natural and simple logical framework for the combination of the computation and deduction paradigms. It supports the design of theorem provers, logic programming languages, constraint solvers and decision procedures. ELAN takes f...

The aim of this paper is to show that a restriction of a logical language to clauses like Horn clauses, as they are used in Prolog, applied to 0,1]{valued logics leads to calculi with a sound and complete proof theory. In opposition to other models where generally the set of axioms as well as the deduction schemata are enriched we restrict ourselves to a simple modiication of the deduction rule...

We present a sequent calculus for intuitionistic non-commutative linear logic (INCLL), show that it satisfies cut elimination, and investigate its relationship to a natural deduction system for the logic. We show how normal natural deductions correspond to cut-free derivations, and arbitrary natural deductions to sequent derivations with cut. This gives us a syntactic proof of normalization for...

Rewriting logic is a well-known logic that emerged as an adequate logical and semantic framework for the specification of languages and systems. ρLog is a calculus for rule-based programming with labeled rules. Its expressive power stems from the usage of a fragment of higher-order logic (e.g., sequence variables, and function variables) to express atomic formulas. Its adequacy as a computation...

ix I Categorial Type Logics 1 1 The Logical Approach in Linguistics 3 1.1 Rule-Based Categorial Grammars . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Classical Categorial Grammar . . . . . . . . . . . . . . . . . . . . 4 1.1.2 Combinatory Categorial Grammar . . . . . . . . . . . . . . . . . 6 1.2 A Logic of Types: Lambek 1958 . . . . . . . . . . . . . . . . . . . . . . . 8 1.2.1 Parsing ...

While inductive and deductive reasoning are considered distinct logical and psychological processes, little is known about their respective neural basis. To address this issue we scanned 16 subjects with fMRI, using an event-related design, while they engaged in inductive and deductive reasoning tasks. Both types of reasoning were characterized by activation of left lateral prefrontal and bilat...

During the last decade computational models of argument have emerged as a successful approach to the formalization of commonsense reasoning, encompassing many other alternative formalisms. Common elements can be identified in such frameworks along with a number of particular features which make it difficult to compare them with each other from a logical viewpoint. This paper presents a unifying...