Defines and examines a notion of logical friendliness, a broadening of the familiar notion of classical consequence. Also reviews familiar notions and operations with which friendliness makes contact, providing a new light in which they may be seen.

We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is tudied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.

We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is tudied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.

We define and examine a notion of logical friendliness, which is a broadening of the familiar notion of classical consequence. The concept is studied first in its simplest form, and then in a syntax-independent version, which we call sympathy. We also draw attention to the surprising number of familiar notions and operations with which it makes contact, providing a new light in which they may be seen.

In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.

We discuss nonmonotonic reasoning in terms of consequence relations and corresponding operators. Based on the matrix consequence that gives the monotonic case, we define a restricted matrix consequence that illustrates the nonmonotonic case. The latter is a generalization of the relation of logical friendliness introduced by D. Makinson. We prove that any restricted single matrix consequence, although it may be nonmonotonic, is always weakly monotonic and, in the case of a finite matrix, the restricted matrix consequence is very strongly (...) finitary. Further, by modifying the definition of logical friendliness relation formulated specifically in a proof-theoretic manner, we show a possibility of obtaining other reflexive nonmonotonic consequence relations, for which a limited result towards finitariness is proved. This leads to numerous questions about nonmonotonic consequence relations in the segment between the monotonic consequence relation based on intuitionistic propositional logic and logical friendliness. (shrink)

What are the limits of the imagination in morality? What role does fiction play in moral thought? My starting point in addressing these questions is Tamar Szabo Gendler's ‘puzzle of imaginative resistance’, the problem of explaining the special difficulties we seem to encounter in imagining to be right what we take to be morally wrong in fiction, and Gendler's claim that those difficulties are due to our unwillingness to imagine these things, rather than our inability to imagine what is logically (...) or conceptually impossible. Using a wide range of examples, I argue that there is no puzzle of imaginative resistance and that to think that there is such a puzzle is to miss almost entirely the role fiction plays in moral thought. That, however, does not mean that there are no limits to what we can imagine in morality. In fact, I argue, the imagination is limited in morality, as elsewhere, by what is logically or conceptually possible. Together, those claims suggest that fiction and the imagination play a fundamental role in shaping our conception of the moral landscape. The paper concludes by drawing some of the consequences of these views for the nature of moral thought. (shrink)

This paper develops a modal, Sentential logic having "not", "if...Then" and necessity as logical constants. The semantics (system of meanings) of the logic is the most obvious generalization of the usual truth-Functional semantics for sentential logic and its deductive system (system of demonstrations) is an obvious generalization of a suitable (jaskowski-Type) natural deductive system for sentential logic. Let a be a set of sentences and p a sentence. "p is a logical consequence of a" is defined relative to (...) the semantics and "p is demonstrable from a" is defined relative to the deductive system. Main meta-Theorem: p is demonstrable from a if and only if p is a logical consequence of a. Henkin-Type methods are used. The theorems of the logic are exactly those of s5. The deductive system is rigorously developed as a system of linear strings. (shrink)

Recent work in philosophical logic has taken interesting and unexpected turns. It has seen not only a proliferation of logical systems, but new applications of a wide range of different formal theories to philosophical questions. As a result, philosophers have been forced to revisit the nature and foundation of core logical concepts, chief amongst which is the concept of logical consequence. This essay sets the contributions of the volume in context and identifies how they advance important debates (...) within the philosophy of logic. (shrink)

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 "Logical consequence: A defense of Tarski" (Journal of Philosophical Logic, vol. 25, 1996, pp. 617-677), Greg Ray defends Tarski's account of logical consequence against the criticisms of John Etchemendy. While Ray's defense of Tarski is largely successful, his attempt to give a general proof that Tarskian consequence preserves truth fails. Analysis of this failure shows that de facto truth preservation is a very weak criterion of adequacy for a theory of logical consequence and should be replaced (...) by a stronger absence-of-counterexamples criterion. It is argued that the latter criterion reflects the modal character of our intuitive concept of logical consequence, and it is shown that Tarskian consequence can be proved to satisfy this criterion for certain choices of logical constants. Finally, an apparent inconsistency in Ray's interpretation of Tarski's position on the modal status of the consequence relation is noted. (shrink)

To understand logic is, first and foremost, to understand logical consequence. This Element provides an in-depth, accessible, up-to-date account of and philosophical insight into the semantic, model-theoretic conception of logical consequence, its Tarskian roots, and its ideas, grounding, and challenges. The topics discussed include: the passage from Tarski's definition of truth to his definition of logical consequence, the need for a non-proof-theoretic definition, the idea of a semantic definition, the adequacy conditions of preservation of truth, formality, and (...) necessity, the nature, structure, and totality of models, the logicality problem that threatens the definition of logical consequence, a general solution to the logicality, formality, and necessity problems/challenges, based on the isomorphism-invariance criterion of logicality, philosophical background and justification of the isomorphism-invariance criterion, and major criticisms of the semantic definition and the isomorphism-invariance criterion. (shrink)

In the paper, there is presented the theory of logical consequence operators indexed with taboo functions. It describes the mechanisms of logical inference in the environment of forbidden sentences. This kind of processes take place in ideological discourses within which their participants create various narrative worlds (mental worlds). A peculiar feature of ideological discourses is their association with taboo structures of deduction which penalize speech acts. The development of discourse involves, among others, transforming its deduction structure towards the (...) proliferation of consequence operators and modifying penalty functions. The presented theory enables to define various processes of these transformations in the precise way. It may be used in analyses of conflicts between competing elm experts acting within a discourse. (shrink)

A good argument is one whose conclusions follow from its premises; its conclusions are consequences of its premises. But in what sense do conclusions follow from premises? What is it for a conclusion to be a consequence of premises? Those questions, in many respects, are at the heart of logic (as a philosophical discipline). Consider the following argument: 1. If we charge high fees for university, only the rich will enroll. We charge high fees for university. Therefore, only the rich (...) will enroll. There are many different things one can say about this argument, but many agree that if we do not equivocate (if the terms mean the same thing in the premises and the conclusion) then the argument is valid, that is, the conclusion follows deductively from the premises. This does not mean that the conclusion is true. Perhaps the premises are not true. However, if the premises are true, then the conclusion is also true, as a matter of logic. This entry is about the relation between premises and conclusions in valid arguments. (shrink)

It is often claimed that nominalistic programmes to reconstruct mathematics fail, since they will at some point involve the notion of logical consequence which is unavailable to the nominalist. In this paper we use an idea of Goodman and Quine to develop a nominalistically acceptable explication of logical consequence.

What is the philosophical significance of the soundness and completeness theorems for first-order logic? In the first section of this paper I raise this question, which is closely tied to current debate over the nature of logical consequence. Following many contemporary authors' dissatisfaction with the view that these theorems ground deductive validity in model-theoretic validity, I turn to measurement theory as a source for an alternative view. For this purpose I present in the second section several of the key (...) ideas of measurement theory, and in the third and central section of the paper I use these ideas in an account of the relation between model theory, formal deduction, and our logical intuitions. (shrink)

One of the great successes in the study of language has been the application of formal methods, including those of formal logic. Even so, this chapter argues against one way of accounting for this success, by arguing that the study of natural language semantics and of logical consequence relations are not the same. There is indeed a lot we can glean about logic from looking at our languages, and at our inferential practices, but the semantic properties of natural languages (...) do not determine genuine logical consequence relations. We can get from natural language semantics to logical consequence, but only by a significant process of identification of logical constants, abstraction, and idealization. The chapter also discusses different approaches to the nature of logical consequence, and examines which allow logic and natural language to come closer together. (shrink)

I discuss the account of logical consequence advanced in Wittgenstein's Tractatus. I argue that the role that elementary propositions are meant to play in this account can be used to explain two remarkable features that Wittgenstein ascribes to them: that they are logically independent from one another and that their components refer to simple objects. I end with a proposal as to how to understand Wittgenstein's claim that all propositions can be analysed as truth functions of elementary propositions.

Logical pluralism is the view that there is more than one correct logic. This is not necessarily a controversial claim but in its most exciting formulations, pluralism extends to logics that have typically been considered rival accounts of logical consequence – to logics, that is, which adopt seemingly contradictory views about basic logical laws or argument forms. The logical pluralist challenges the philosophical orthodoxy that an argument is either deductively valid or invalid by claiming that there (...) is more than one way for an argument to be valid. In this book, Erik Stei defends logical monism, the view that there is exactly one correct logic. He provides a detailed analysis of different possible formulations of logical pluralism, and offers an original account of the plurality of correct logics that incorporates the benefits of both pluralist and monist approaches to logical consequence. His book will be valuable for a range of readers in the philosophy of logic. (shrink)

Deflationists about truth seek to undermine debates about the nature of truth by arguing that the truth predicate is merely a device that allows us to express a certain kind of generality. I argue that a parallel approach is available in the case of logical consequence. Just as deflationism about truth offers an alternative to accounts of truth's nature in terms of correspondence or justification, deflationism about consequence promises an alternative to model-theoretic or proof-theoretic accounts of consequence's nature. I (...) then argue, against considerations put forward by Field and Beall, that Curry's paradox no more rules out deflationism about consequence than the liar paradox rules out deflationism about truth. (shrink)

ABSTRACT The concept of paraconsistent logical consequence is usually negatively defined as a validity semantics in which not every sentences is deducible or in which inferential explosion does not occur. Paraconsistency has been negatively characterized in this way because paraconsistent logics have been designed specifically to avoid the trivialization of deductive inference entailed by the classical paradoxes of material implication for applications in a system that tolerates syntactical contradictions. The effect of the negative characterization of paraconsistency has been to (...) encourage an unsystematic development of distinct versions of paraconsistent logic. It has also contributed to a restricted overview of the full range of paraconsistent formalisms. After reviewing a standard negative characterization of paraconsistency and commenting on its limitations, I propose a positive characterization that makes possible a constructivistic description of the complete spectrum of distinct families of paraconsistent logics, and the description of a new type of maximally relevant paraconsistency, which I argue compares favorably with previously identified categories of paraconsistent logics. (shrink)

Our pretheoretic sense of the relation of logical consequence arises from our experience of deductive inference. By ignoring the priority of inference and failing to provide an account of the ontological grounds of the conceptual experience and of the modal and truth elements in the statement of our pretheoretical sense, informal and technical accounts are at best partial. This paper proposes an ontological analysis of both elements which accounts for our conceptual experience and differentiates genuine from ersatz logical (...) consequence. (shrink)

A substitutional account of logical validity for formal first‐order languages is developed and defended against competing accounts such as the model‐theoretic definition of validity. Roughly, a substitution instance of a sentence is defined as the result of uniformly substituting nonlogical expressions in the sentence with expressions of the same grammatical category and possibly relativizing quantifiers. In particular, predicate symbols can be replaced with formulae possibly containing additional free variables. A sentence is defined to be logically true iff all its (...) substitution instances are satisfied by all variable assignments. Logical consequence is defined analogously. Satisfaction is taken to be a primitive notion and axiomatized.For every set‐theoretic model in the sense of model theory there exists a corresponding substitutional interpretation in a sense to be specified. Conversely, however, there are substitutional interpretations – in particular the ‘intended’ interpretation – that lack a model‐theoretic counterpart. The substitutional definition of logical validity overcomes the weaknesses of more restrictive accounts of substitutional validity; unlike model‐theoretic logical consequence, the substitutional notion is trivially and provably truth preserving. In Kreisel's squeezing argument the formal notion of substitutional validity naturally slots into the place of intuitive validity. (shrink)

Logical consequence is a notion that every person who reasons must possess, at least implicitly. To give a precise and accurate characterization of this notion is the fundamental task of logic. In a similar way, the notion of effectivity is a concept that anyone with a basic training in mathematics possesses, and the most fundamental task of a theory of computability is to give a precise characterization of this notion. The problem concerning effectivity was solved in the 1930s, almost (...) as soon as it was raised, by the work of Turing, Church, and others. By contrast, the correct and precise characterization of logical consequence has been hotly contested through the two and a half thousand-year history of logic. (shrink)

This paper deals with the adequacy of the model-theoretic definition of logical consequence. Logical consequence is commonly described as a necessary relation that can be determined by the form of the sentences involved. In this paper, necessity is assumed to be a metaphysical notion, and formality is viewed as a means to avoid dealing with complex metaphysical questions in logical investigations. Logical terms are an essential part of the form of sentences and thus have a crucial (...) role in determining logical consequence. Gila Sher and Stewart Shapiro each propose a formal criterion for logical terms within a model-theoretic framework, based on the idea of invariance under isomorphism. The two criteria are formally equivalent, and thus we have a common ground for evaluating and comparing Sher and Shapiro philosophical justification of their criteria. It is argued that Shapiro's blended approach, by which models represent possible worlds under interpretations of the language, is preferable to Sher’s formal-structural view, according to which models represent formal structures. The advantages and disadvantages of both views’ reliance on isomorphism are discussed. (shrink)

Dependence logic, introduced in Väänänen [11], cannot be axiomatized. However, first-order consequences of dependence logic sentences can be axiomatized, and this is what we shall do in this paper. We give an explicit axiomatization and prove the respective Completeness Theorem.

Les notions logiques de conséquence sont fréquemment reliées à des concepts de solution de la théorie des jeux. Dans ce contexte domine la correspondance entre une formule classiquement valide et l’existence d’une stratégie gagnante pour un joueur dans un jeu à deux joueurs. Nous proposons une extension conservative de la notion classique de conséquence basée sur une généralisation du concept de solution de jeu d’équilibre de Nash.

In his classic 1936 essay "On the Concept of Logical Consequence", Alfred Tarski used the notion of satisfaction to give a semantic characterization of the logical properties. Tarski is generally credited with introducing the model-theoretic characterization of the logical properties familiar to us today. However, in his book, The Concept of Logical Consequence, Etchemendy argues that Tarski's account is inadequate for quite a number of reasons, and is actually incompatible with the standard model-theoretic account. Many of (...) his criticisms are meant to apply to the model-theoretic account as well. In this paper, I discuss the following four critical charges that Etchemendy makes against Tarski and his account of the logical properties: (1) (a) Tarski's account of logical consequence diverges from the standard model-theoretic account at points where the latter account gets it right. (b) Tarski's account cannot be brought into line with the model-theoretic account, because the two are fundamentally incompatible. (2) There are simple counterexamples (enumerated by Etchemendy) which show that Tarski's account is wrong. (3) Tarski committed a modal fallacy when arguing that his account captures our pre-theoretical concept of logical consequence, and so obscured an essential weakness of the account. (4) Tarski's account depends on there being a distinction between the "logical terms" and the "non-logical terms" of a language, but (according to Etchemendy) there are very simple (even first-order) languages for which no such distinction can be made. Etchemendy's critique raises historical and philosophical questions about important foundational work. However, Etchemendy is mistaken about each of these central criticisms. In the course of justifying that claim, I give a sustained explication and defense of Tarski's account. Moreover, since I will argue that Tarski's account and the model theoretic account really do come to the same thing, my subsequent defense of Tarski's account against Etchemendy's other attacks doubles as a defense against criticisms that would apply equally to the familiar model-theoretic account of the logical properties. (shrink)

Compare two conceptions of validity: under an example of a modal conception, an argument is valid just in case it is impossible for the premises to be true and the conclusion false; under an example of a topic-neutral conception, an argument is valid just in case there are no arguments of the same logical form with true premises and a false conclusion. This taxonomy of positions suggests a project in the philosophy of logic: the reductive analysis of the modal (...) conception of logical consequence to the topic-neutral conception. Such a project would dispel the alleged obscurity of the notion of necessity employed in the modal conception in favour of the clarity of an account of logical consequence given in terms of tractable notions of logical form, universal generalization and truth simpliciter. In a series of publications, John Etchemendy has characterized the model-theoretic definition of logical consequence as truth preservation in all models as intended to provide just such an analysis. In this paper, I will argue that Aristotle intends to provide an account of a modal conception of logical consequence in topic-neutral terms and so is engaged in a project comparable to the one described above. That Aristotle would be engaged in this sort of project is controversial. Under the standard reading of the Prior Analytics, Aristotle does not and cannot provide an account of logical consequence. Rather, he must take the validity of the first figure syllogisms (such as the syllogism known by its medieval mnemonic ‘Barbara’: A belongs to all B; B belongs to all C; so A belongs to all C) as obvious and not needing justification; he then establishes the validity of the other syllogisms by showing that they stand in a suitable relation to the first figure syllogisms. I will argue that Aristotle does attempt to provide an account of logical consequence—namely, by appeal to certain mereological theorems. For example, he defends the status of Barbara as a syllogism by appeal to the transitivity of mereological containment. There are, as I will discuss, reasons to doubt the success of this account. But the attempt is not implausible given certain theses Aristotle holds in semantics, mereology and the theory of relations. (shrink)

It has been argued that alethic pluralists -- who hold that there are several distinct truth properties -- face a problem when it comes to defining validity. Via consideration of the classical concept of logical consequence, and of strategies for defining validity in many-valued logics, this paper proposes two new kinds of solution to the problem.

Logic is formal in the sense that all arguments of the same form as logically valid arguments are also logically valid and hence truth-preserving. However, it is not known whether all arguments that are valid in the usual model-theoretic sense are truthpreserving. Tarski claimed that it could be proved that all arguments that are valid (in the sense of validity he contemplated in his 1936 paper on logical consequence) are truthpreserving. But he did not offer the proof. The question (...) arises whether the usual modeltheoretic sense of validity and Tarski's 1936 sense are the same. I argue in this paper that they probably are not, and that the proof Tarski had in mind, although unusable to prove that model-theoretically valid arguments are truth-preserving, can be used to prove that arguments valid in Tarski's 1936 sense are truth-preserving. (shrink)

_ Source: _Volume 56, Issue 3-4, pp 201 - 221 This paper summarizes medieval definitions and divisions of consequences and explains the import of the medieval development of the theory of consequence for logic today. It then introduces the various contributions to this special issue of _Vivarium_ on consequences in medieval logic.

Logical consequence is the relation that obtains between premises and conclusion(s) in a valid argument. Orthodoxy has it that valid arguments are necessarily truth-preserving, but this platitude only raises a number of further questions, such as: how does the truth of premises guarantee the truth of a conclusion, and what constraints does validity impose on rational belief? This volume presents thirteen essays by some of the most important scholars in the field of philosophical logic. The essays offer ground-breaking new (...) insights into the nature of logical consequence; the relation between logic and inference; how the semantics and pragmatics of natural language bear on logic; the relativity of logic; and the structural properties of the consequence relation. (shrink)

Shapiro (Philos Q 61:320–342, 2011) argues that, if we are deflationists about truth, we should be deflationists about logical consequence. Like the truth predicate, he claims, the logical consequence predicate is merely a device of generalisation and more substantial characterisation, e.g. proof- or model-theoretic, is mistaken. I reject his analogy between truth and logical consequence and argue that, by appreciating how the logical consequence predicate is used as well as the goals of proof theory and model (...) theory, we can be deflationists about truth but not logical consequence. (shrink)

This is a title on the foundations of defeasible logic, which explores the formal properties of everyday reasoning patterns whereby people jump to conclusions, reserving the right to retract them in the light of further information. Although technical in nature the book contains sections that outline basic issues by means of intuitive and simple examples. This book is primarily targeted at philosophers interested in the foundations of defeasible logic, logicians, and specialists in artificial intelligence and theoretical computer science.

This chapter provides broad coverage of the notion of logical consequence, exploring its modal, semantic, and epistemic aspects. It develops the contrast between proof-theoretic notion of consequence, in terms of deduction, and a model-theoretic approach, in terms of truth-conditions. The main purpose is to relate the formal, technical work in logic to the philosophical concepts that underlie reasoning.

We present a framework that provides a logic for science by generalizing the notion of logical (Tarskian) consequence. This framework will introduce hierarchies of logical consequences, the first level of each of which is identified with deduction. We argue for identification of the second level of the hierarchies with inductive inference. The notion of induction presented here has some resonance with Popper's notion of scientific discovery by refutation. Our framework rests on the assumption of a restricted class of (...) structures in contrast to the permissibility of classical first-order logic. We make a distinction between deductive and inductive inference via the notions of compactness and weak compactness. Connections with the arithmetical hierarchy and formal learning theory are explored. For the latter, we argue against the identification of inductive inference with the notion of learnable in the limit. Several results highlighting desirable properties of these hierarchies of generalized logical consequence are also presented. (shrink)

In this paper I ask what logical consequence is, and give an answer that is somewhat different from the usual ones. It isn’t clear why anyone would need a new approach to logical consequence, so I begin by explaining the work that I need the answer to do and why the standard conceptions aren’t adequate. Then I articulate a replacement view which is.

The modern view of logical reasoning as modeled by a consequence operator has allowed for huge developments in the study of logic as an abstract discipline. Still, it is unable to explain why it is often the case that the same designation is used, in an ambiguous way, to describe several distinct modes of reasoning over the same logical language. A paradigmatic example of such a situation is ‘modal logic’, a terminology which can encompass reasoning over Kripke frames, (...) but also over Kripke models, and in any case either locally or globally . Herein, we adopt a novel abstract notion of logic presented as a lattice-structured hierarchy of consequence operators, and explore some common proof-theoretic and model-theoretic ways of presenting such hierarchies through a collection of meaningful examples. In order to illustrate the usefulness of the notion of hierarchical consequence operators we address a few questions in the theory of combined logics, where a suitable abstract presentation of the logics being combined is absolutely essential. We show how to define the operation, in general, and we achieve a number of interesting preservation results for fibring within the context of 2-hierarchies. (shrink)

Information is contained in statements and «flows» from their structure and meaning of expressions they contain. The information that flows only from the meaning of logical constants and logical structure of statements we will call logical information. In this paper we present a formal explication of this notion which is proper for sentences being Boolean combination of atomic sentences. 1 Therefore we limit ourselves to analyzing logical information flowing only from the meaning of truth-value connectives and (...) logical structure of sentences connected with these connectives. (shrink)

Introduction -- The concept of logical consequence -- Tarski's characterization of the common concept of logical consequence -- The logical consequence relation has a modal element -- The logical consequence relation is formal -- The logical consequence relation is A priori -- Logical and non-logical terminology -- The meanings of logical terms explained in terms of their semantic properties -- The meanings of logical terms explained in terms of their inferential properties (...) -- Model-theoretic and deductive-theoretic conceptions of logic -- Linguistic preliminaries : the language M -- Syntax of M -- The definition of a well formed formula of M -- Semantics for M -- The sentential connectives are defined -- The notion of satisfaction is introduced and the quantifiers are defined -- Model-theoretic consequence -- Truth in a structure -- Satisfaction revisited -- Formalized definition of truth -- Model-theoretic consequence defined -- The model-theoretic definition and the concept of logical consequence -- Does the model theoretic consequence relation reflect the salient features of the common concept of logical consequence? -- What is a logical constant? -- Deductive consequence -- Deductive system n -- The deductive theoretic definition and the concept of logical consequence -- Tarski's criticism of the deductive theoretic definition -- Is N a correct deductive system? (shrink)

The semantic analysis of logical consequence must obey a set of requisites which nowadays have acquired a dogmatic status. This situation prevents the development of other varieties of this fundamental relation. In this issue we try to define what we call a naive variety of logical consequence. The main feature of this relation is the way it depends on formulas in premises and conclusion: every sentence must contribute to the acceptability of an argument in a significative way. This (...) circumstance can be of some interest for research programs demanding a logical apparatus sensitive to application context. We think of the logic LP developed by G. Priest -- Priest [1979] -- in relation to Gödel incompleteness theorems as a test for our points of view. (shrink)