This paper compares several models of formalization. It articulates criteria of correct formalization and identifies their problems. All of the discussed criteria are so called “semantic” criteria, which refer to the interpretation of logical formulas. However, as will be shown, different versions of an implicitly applied or explicitly stated criterion of correctness depend on different understandings of “interpretation” in this context.

Sumário: 1. El caso del método científico, Alberto Oliva; 2. Un capítulo de la prehistoria de las ciencias humanas: la defensa por Vico de la tópica, Jorge Alberto Molina; 3. La figura de lo cognoscible y los mundos, Pablo Vélez León; 4. Lebenswelt de Husserl y las neurociencias, Vanessa Fontana; 5. El uso estético del concepto de mundos posibles, Jairo Dias Carvalho; 6. Realismo normativo no naturalista y mundos morales imposibles, Alcino Eduardo Bonella; 7. En la lógica de pragmatismo, Hércules (...) de Araujo Feitosa, Luiz Henrique da Cruz Silvestrini; 8 La lógica, el tiempo y el lenguaje natural: un sistema formal para tiempos de portugués, Carlos Luciano Manholi. / Temas em filosofia contemporânea II / Jonas Rafael Becker Arenhart, Jaimir Conte, Cezar Augusto Mortari (orgs.) – Florianópolis : NEL/UFSC, 2016. 167 p. : tabs. - (Rumos da epistemologia ; v. 14); ISBN 978-85-87253-27-9 (papel); ISBN 978-85-87253-26-2 (e-book). (shrink)

We can distinguish two non-equivalent ways in which a natural language argument can be valid: it can be interpretationally or representationally valid. However, there is just one notion of classical first-order validity for formal languages: truth-preservation in all classical first-order models. To ease the tension, Baumgartner suggests that we should understand interpretational and representational validity as imposing different adequacy conditions on formalizations of natural language arguments. I argue against this proposal. To that end, I first show that Baumgartner’s definition of (...) representational validity is extensionally inadequate. I present a number of natural language arguments that we pre-theoretically hold to be representationally valid, but are not representationally valid according to Baumgartner’s definition. I then point to two further untenable features of Baumgartner’s definitions: according to Baumgartner’s definition of a representationally correct formalization, we cannot arrive at formalizations in a recursive way, and Baumgartner’s definition of representational validity is non-monotonic. I conclude that interpretational and representational validity cannot be understood as merely imposing different adequacy conditions on formalizations. If we want to capture our interpretational and representational intuitions, we need two different formal definitions of validity. (shrink)

The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.

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)

This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals (...) are drawn concerning the possibility of having two logical systems that are "empirically distinct" but are both translationally equivalent to a common logic. (shrink)

We study logic translations from an abstract perspective, without any commitment to the structure of sentences and the nature of logical entailment, which also means that we cover both proof- theoretic and model-theoretic entailment. We show how logic translations induce notions of logical expressiveness, consistency strength and sublogic, leading to an explanation of paradoxes that have been described in the literature. Connectives and quantifiers, although not present in the definition of logic and logic translation, can be recovered by their abstract (...) properties and are preserved and reflected by translations under suitable conditions. (shrink)

In philosophical contexts, logical formalisms are often resorted to as a means to render the validity and invalidity of informal arguments formally transparent. Since Oliver and Massey , however, it has been recognized in the literature that identifying valid arguments is easier than identifying invalid ones. Still, any viable theory of adequate logical formalization should at least reliably identify valid arguments. This paper argues that accounts of logical formalization as developed by Blau and Brun do not meet that benchmark. The (...) paper ends by suggesting different strategies to remedy the problem. (shrink)

In the paper, we examine tableau systems for R. Epstein’s logics of content relationship: D (Dependence Logic), DD (Dual Dependence Logic), Eq (Logic of Equality of Content), S (Symmetric Relatedness Logic) and R (Nonsymmetric Relatedness Logic) (cf. Epstein in Philos Stud 36:137–173, 1979, Epstein in Rep. Math. Logic 21:19–34, 1987, Klonowski in Logic Log Philos 30(4):579–629, 2021, Krajewski in J Non Class Logic 8:7–33, 1991). The first tableau systems for those logics were defined by Carnielli. However, his approach has some (...) limitations, for example, it requires a proof of functional completeness and axiomatization. Notwithstanding the first two constraints, it does not include all Epstein logics, e.g., logic Eq. Unlike Carnielli’s approach, here we use set-assignment semantics to determine those logics. Since syntax and semantics of a given logic usually determine a minimal syntax and structure of a tableau system for the logic along with other properties, we propose a uniform tableau framework for the logics determined by set-assignment semantics. What distinguishes our tableau systems is that they combine the features of tableaux for propositional logics and syllogistic logics when the problem of content of propositions is analysed in tableau proofs. To denote the content of propositions in the proofs, we use generalised labels (see Jarmużek and Goré in Landscapes in Logic, College Publications, London, 2021). (shrink)

What does it take for two logics to be mere notational variants? The present paper proposes a variety of different ways of cashing out notational variance, in particular isolating a constraint on any reasonable account of notational variance which makes plausible that the only kinds of translations which can witness notational variance are what are sometimes called definitional translations.

In 1999, da Silva, D'Ottaviano and Sette proposed a general definition for the term translation between logics and presented an initial segment of its theory. Logics are characterized, in the most general sense, as sets with consequence relations and translations between logics as consequence-relation preserving maps. In a previous paper the authors introduced the concept of conservative translation between logics and studied some general properties of the co-complete category constituted by logics and conservative translations between them. In this paper we (...) present some conservative translations involving classical logic, Lukasiewicz three-valued system L₃, the intuitionistic system Iⁱ and several para-consistent logics, as for instance Sette's system Pⁱ, the D'Ottaviano and da Costa system J₃ and da Costa's systems $\text{C}_{n}$ , 1 ≤ n ≤ ω. (shrink)

ABSTRACT This work presents the concepts of translation and conservative translation between logics. By using algebraic semantics we introduce several conservative translations involving the classical propositional calculus and the many-valued calculi of Post and Lukasiewicz.

After a brief promenade on the several notions of translations that appear in the literature, we concentrate on three paradigms of translations between logics: ( conservative ) translations , transfers and contextual translations . Though independent, such approaches are here compared and assessed against questions about the meaning of a translation and about comparative strength and extensibility of a logic with respect to another.

There is a long-standing debate whether propositions, sentences, statements or utterances provide an answer to the question of what objects logical formulas stand for. Based on the traditional understanding of logic as a science of valid arguments, this question is firstly framed more exactly, making explicit that it calls not only for identifying some class of objects, but also for explaining their relationship to ordinary language utterances. It is then argued that there are strong arguments against the proposals commonly put (...) forward in the debate. The core of the problem is that an informative account of the objects formulas stand for presupposes a theory of formalization; that is, a theory that explains what formulas may adequately substitute for an inference in proofs of validity. Although such theories are still subject to research, some consequences can be drawn from an analysis of the reasons why the common accounts featuring sentences, propositions or utterances fail. Theories of formalization cannot refer to utterances qua expressions of propositions; instead they may refer to sentences and rely on additional information about linguistic structure and pragmatic context. (shrink)

According to the standard opinions in the literature, blocking the unacceptable consequences of the notorious slingshot argument requires imposing constraints on the metaphysics of facts or on theories of definite descriptions (or class abstracts). This paper argues that both of these well-known strategies to rebut the slingshot overshoot the mark. The slingshot, first and foremost, raises the question as to the adequate logical formalization of statements about facts, i.e. of factual contexts. It will be shown that a rigorous application of (...) Quine’s maxim of shallow analysis to formalizations of factual contexts paves the way for an account of formalizing such contexts which blocks the slingshot without ramifications for theories of facts or definite descriptions. (shrink)

A natural language argument may be valid in at least two nonequivalent senses: it may be interpretationally or representationally valid (Etchemendy in The concept of logical consequence. Harvard University Press, Cambridge, 1990). Interpretational and representational validity can both be formally exhibited by classical first-order logic. However, as these two notions of informal validity differ extensionally and first-order logic fixes one determinate extension for the notion of formal validity (or consequence), some arguments must be formalized by unrelated nonequivalent formalizations in order (...) to formally account for their interpretational or representational validity, respectively. As a consequence, arguments must be formalized subject to different criteria of adequate formalization depending on which variant of informal validity is to be revealed. This paper develops different criteria that formalizations of an argument have to satisfy in order to exhibit the latter’s interpretational or representational validity. (shrink)

This article identifies problems with regard to providing criteria that regulate the matching of logical formulae and natural language. We then take on to solve these problems by defining a necessary and sufficient criterion of adequate formalization. On the basis of this criterion we argue that logic should not be seen as an ars iudicandi capable of evaluating the validity or invalidity of informal arguments, but as an ars explicandi that renders transparent the formal structure of informal reasoning.

In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is (...) treated as designated, the above logic is a “common denominator” for Kleene and Łukasiewicz 3-valued logics, which represent its two different “determinizations”. In turn, the weak semantics—where both t and u are treated as designated—represents such a “common denominator” for two major 3-valued paraconsistent logics. We give sound and complete, cut-free sequent calculi for both versions of the logic generated by the rough set Nmatrix. Then we derive from these calculi sequent calculi with the same properties for the various “determinizations” of those two versions of the logic (including Łukasiewicz 3-valued logic). Finally, we show how to embed the four above-mentioned determinizations in extensions of the basic rough set logics obtained by adding to those logics a special two-valued “definedness” or “crispness” operator. (shrink)

A quasi-canonical Gentzen-type system is a Gentzen-type system in which each logical rule introduces either a formula of the form , or of the form , and all the active formulas of its premises belong to the set . In this paper we investigate quasi-canonical systems in which exactly one of the two classical rules for negation is included, turning the induced logic into either a paraconsistent logic or a paracomplete logic, but not both. We provide a constructive coherence criterion (...) for such systems, and show that a quasi-canonical system of the type we investigate is coherent iff it is strongly paraconsistent or strongly paracomplete (in a sense defined in the paper), iff it has a trivalent, non-deterministic semantics of a special type (also defined in the paper) for which it is sound and complete. Finally, we determine when a system of this sort admits cut-elimination, and provide a simple procedure for transforming one which does not into one which does. (shrink)

The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. (...) The outcome are paraconsistent logics with a lot of desirable properties.1. (shrink)

Although a very recent topic in contemporary logic, the subject of combinations of logics has already shown its deep possibilities. Besides the pure philosophical interest offered by the possibility of defining mixed logic systems in which distinct operators obey logics of different nature, there are also several pragmatical and methodological reasons for considering combined logics. We survey methods for combining logics (integration of several logic systems into a homogeneous environment) as well as methods for decomposing logics, showing their interesting properties (...) and applications. (shrink)

According to a prevalent view among philosophers formal logic is the philosopher’s main tool to assess the validity of arguments, i.e. the philosopher’s ars iudicandi. By drawing on a famous dispute between Russell and Strawson over the validity of a certain kind of argument – of arguments whose premises feature definite descriptions – this paper casts doubt on the accuracy of the ars iudicandi conception. Rather than settling the question whether the contentious arguments are valid or not, Russell and Strawson, (...) upon discussing the proper logical analysis of definite descriptions, merely contrast converse informal validity assessments rendered explicit by nonequivalent logical for-malizations. (shrink)

There are many different ways to talk about the world. Some ways of talking are more expressive than others—that is, they enable us to say more things about the world. But what exactly does this mean? When is one language able to express more about the world than another? In my dissertation, I systematically investigate different ways of answering this question and develop a formal theory of expressive power, translation, and notational variance. In doing so, I show how these investigations (...) help to clarify the role that expressive power plays within debates in metaphysics, logic, and the philosophy of language. (shrink)

This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend this constructive (...) method to non-classical fragments equipped with weaker implications (that avoid Curry's objection). This is the case, for example, of Jan Lukasiewicz's n-valued logics and Wilhelm Ackermann's logic of restricted implication. Besides such problems, both Henkin's method and the triviality phenomenon enable us to propose a new positive tableau proof system which uses only positive meta-linguistic resources, and to mo- tivate a new discussion concerning the role of negation in logic proposing the concept of paratriviality. In this way, some relations between positive reasoning and infinity, the possibilities to obtain a ¯first-order positive logic as well as the philosophical connection between truth and meaning are dis- cussed from a conceptual point of view. (shrink)