A. Tarskiego kryterium monotoniczności operatora konsekwencji w międzykulturowych badaniach systemów wniskowań

In this article I refer to the issue of comparative research methodology and methods of philosophical argumentation systems with different cultural areas. In relation to that shown by A. Tarski logical consequence operator, will establish criteria for the comparative analysis of systems inferences different cultural areas of the property based on the operator monotonic consequences

Invariance and Logicality in Perspective

Although the invariance criterion of logicality first emerged as a criterion of a purely mathematical interest, it has developed into a criterion of considerable linguistic and philosophical interest. In this paper I compare two different perspectives on this criterion. The first is the perspective of natural language. Here, the invariance criterion is measured by its success in capturing our linguistic intuitions about logicality and explaining our logical behavior in natural-linguistic settings. The second perspective is more theoretical. Here, the invariance criterion is used as a tool for developing a theoretical foundation of logic, focused on a critical examination, explanation, and justification of its veridicality and modal force

Knowing-How and the Deduction Theorem

In his seminal address delivered in 1945 to the Royal Society Gilbert Ryle considers a special case of knowing-how, viz., knowing how to reason according to logical rules. He argues that knowing how to use logical rules cannot be reduced to a propositional knowledge. We evaluate this argument in the context of two different types of formal systems capable to represent knowledge and support logical reasoning: Hilbert-style systems, which mainly rely on axioms, and Gentzen-style systems, which mainly rely on rules. We build a canonical syntactic translation between appropriate classes of such systems and demonstrate the crucial role of Deduction Theorem in this construction. This analysis suggests that one's knowledge of axioms and one's knowledge of rules under appropriate conditions are also mutually translatable. However our further analysis shows that the epistemic status of logical knowing-how ultimately depends on one's conception of logical consequence: if one construes the logical consequence after Tarski in model-theoretic terms then the reduction of knowing-how to knowing-that is in a certain sense possible but if one thinks about the logical consequence after Prawitz in proof-theoretic terms then the logical knowledge-how gets an independent status. Finally we extend our analysis to the case of extra-logical knowledge-how representable with Gentzen-style formal systems, which admit constructive meaning explanations. For this end we build a typed sequential calculus and prove for it a ``constructive'' Deduction Theorem interpretable in extra-logical terms. We conclude with a number of open questions, which concern translations between knowledge-how and knowledge-that in this more general semantic setting

Knowing-How and the Deduction Theorem

In his seminal address delivered in 1945 to the Royal Society Gilbert Ryle considers a special case of knowing-how, viz., knowing how to reason according to logical rules. He argues that knowing how to use logical rules cannot be reduced to a propositional knowledge. We evaluate this argument in the context of two different types of formal systems capable to represent knowledge and support logical reasoning: Hilbert-style systems, which mainly rely on axioms, and Gentzen-style systems, which mainly rely on rules. We build a canonical syntactic translation between appropriate classes of such systems and demonstrate the crucial role of Deduction Theorem in this construction. This analysis suggests that one's knowledge of axioms and one's knowledge of rules under appropriate conditions are also mutually translatable. However our further analysis shows that the epistemic status of logical knowing-how ultimately depends on one's conception of logical consequence: if one construes the logical consequence after Tarski in model-theoretic terms then the reduction of knowing-how to knowing-that is in a certain sense possible but if one thinks about the logical consequence after Prawitz in proof-theoretic terms then the logical knowledge-how gets an independent status. Finally we extend our analysis to the case of extra-logical knowledge-how representable with Gentzen-style formal systems, which admit constructive meaning explanations. For this end we build a typed sequential calculus and prove for it a ``constructive'' Deduction Theorem interpretable in extra-logical terms. We conclude with a number of open questions, which concern translations between knowledge-how and knowledge-that in this more general semantic setting

Consecuencia lógica: modelos conjuntistas y aspectos modales

According to Etchemendy, in attempting to offer an analysis of the modal features of the intuitive concept of logical consequence, Tarski has committed a modal fallacy. In this paper, I consider the thesis according to it is posible to analyze the modals properties of concept of logical consequence through of a generalization on set-theoretical interpretations. As is known, some philosophers have tried to argue for the transit from the general to the modal by showing that there are enough settheoretic interpretations so as to be able to represent the modal features of the intuitive concept of consequence. As is also known, those people have encountered a lot of difficulties. In the present paper, I will try to show that those problems are related not with the specific possibility of accounting for the modal features by means of a set-theoretic notion of model but with the possibility of coming up with a precise mathematical theory for the concept of interpretation, and, as such, they can be solved by way of appealing to the usual solutions to this problem

A quantitative-informational approach to logical consequence

In this work, we propose a definition of logical consequence based on the relation between the quantity of information present in a particular set of formulae and a particular formula. As a starting point, we use Shannon‟s quantitative notion of information, founded on the concepts of logarithmic function and probability value. We first consider some of the basic elements of an axiomatic probability theory, and then construct a probabilistic semantics for languages of classical propositional logic. We define the quantity of information for the formulae of these languages and introduce the concept of informational logical consequence, identifying some important results, among them: certain arguments that have traditionally been considered valid, such as modus ponens, are not valid from the informational perspective; the logic underlying informational logical consequence is not classical, and is at the least paraconsistent sensu lato; informational logical consequence is not a Tarskian logical consequence

The philosophy of logic

Postprin

On the Mutual Definability of the Notions of Entailment, Rejection, and Inconsistency

In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author has proved that the theories T+, T−, and T′ are equivalent

An analysis of the logic of Riesz Spaces with strong unit

We study \L ukasiewicz logic enriched with a scalar multiplication with scalars taken in $[0,1]$. Its algebraic models, called {\em Riesz MV-algebras}, are, up to isomorphism, unit intervals of Riesz spaces with a strong unit endowed with an appropriate structure. When only rational scalars are considered, one gets the class of {\em DMV-algebras} and a corresponding logical system. Our research follows two objectives. The first one is to deepen the connections between functional analysis and the logic of Riesz MV-algebras. The second one is to study the finitely presented MV-algebras, DMV-algebras and Riesz MV-algebras, connecting them from logical, algebraic and geometric perspective