A lógica I1, um sistema trivalorado de caráter fracamente intuicionista, foi introduzida, via sistema axiomático (Hilbertiano) em 1995 por Sette e Carnielli. O presente artigo tem por objetivo apresentar esse sistema em um formalismo lógico em Cálculo de Sequentes, denominado de GI1, o qual se apresenta como um sistema de prova de teoremas, caracterizado como um algoritmo, sendo mais aplicável do ponto de vista computacional, por meio da dualização do sistema de tableaux analíticos TI1. Ademais, é apresentado a (...) equivalência dedutiva entre o sistema de sequentes GI1 com o sistema Hilbertiano I1. (shrink)

El presente artículo es un reconocimiento y un homenaje a L'Höpital, de cuya muerte se ha cumplido recientemente el tercer centenario. En él se estudia la correspondencia L'Höpital-Leibniz para analizar el recientemente creado por Leibiz cálculo diferencial e integral y su ontología subyacente, así como la publicación del primer manual sobre la materia escrito por L'Höpital.

RESUMO O presente artigo apresenta uma semântica baseada nas atitudes cognitivas de aceitação e rejeição por uma sociedade de agentes para lógicas inspiradas no First Degree Entailment de Dunn e Belnap. Diferente das situações epistêmicas originalmente usadas em E, as atitudes cognitivas não coincidem com valores-de-verdade e parecem mais adequadas para as lógicas que pretendem considerar o conteúdo informacional de proposições “ditas verdadeiras” tanto quanto as proposições “ditas falsas” como determinantes da noção de validade das inferências. Após analisar algumas lógicas (...) associadas à semântica proposta, introduzimos a lógica E B cuja relação de consequência semântica subjacente - o B-entailment - é capaz de expressar diversos tipos de raciocínio em relação às atitudes cognitivas de aceitação e rejeição. Apresentamos também um cálculo de sequentes correto e completo para E B.ABSTRACT In the present work I introduce a semantics based on the cognitive attitudes of acceptation and rejection entertained by a given society of agents for logics inspired on Dunn and Belnap’s ‘First Degree Entailment’. Distinctly from the original epistemic situation of E, the cognitive attitudes do not coincide with truth-values and it seems more suitable for logics that intend to consider the informational content of propositions “said to be true” as well as propositions “said to be false” as determinants of the notion of logical validity. After analyzing some logics associated with the proposed semantics, we introduce the logic E B, whose underlying semantic entailment relation - the B-entailment - is able to express several kinds of reasoning towards the cognitive attitudes of acceptance and rejection. Acorrect and complete sequent calculus for E B is also presented. (shrink)

http://dx.doi.org/10.5007/1808-1711.2009v13n3p357 Neste trabalho concorda-se com a tese de I. Hacking segundo a qual o significado das constantes lógicas é dado pelas Regras de Introdução e Eliminação do cálculo de sequentes de Gentzen que caracterizam a concepção da noção de consequência lógica abstrata. Perguntamos quais são as regras mínimas que um conectivo deve satisfazer para que seja considerado uma negação genuína. Tomaremos como referência para tratar dessa questão os C-sistemas de Newton da Costa e o sistema LP de Graham (...) Priest. Finalmente, analisaremos esses sistemas na lógica de sequentes a fim de mostrar que a negação paraconsistente ou bem carece das regras puras de eliminação e negação da negação ou ela envolve outros conectivos, o que torna difícil atribuir um significado unívoco à negação paraconsistente. (shrink)

In this paper we give a brief treatment of a theory of proofs for a system of Full Intuitionistic Linear Logic. This system is distinct from Classical Linear Logic, but unlike the standard Intuitionistic Linear Logic of Girard and Lafont includes the multiplicative disjunction par. This connective does have an entirely natural interpretation in a variety of categorical models of Intuitionistic Linear Logic. The main proof-theoretic problem arises from the observation of Schellinx that cut elimination fails outright for an intuitive (...) formulation of Full Intuitionistic Linear Logic; the nub of the problem is the interaction between par and linear implication. We present here a term assignment system which gives an interpretation of proofs as some kind of non-deterministic function. In this way we find a system which does enjoy cut elimination. The system is a direct result of an analysis of the categorical semantics, though we make an effort to present the system as if it were purely a proof-theoretic construction. (shrink)

The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant logics.

We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.

Este estudo visa a apresentar e analisar a Carta XXXVIII, de 1º de outubro de 1666, escrita por Espinosa. De conteúdo exclusivamente matemático, seu texto responde a uma questão de probabilidade aplicada a jogos de apostas em que é preciso preservar, para todos os jogadores, a mesma chance de ganhar. Para isso, apresentaremos o contexto histórico e exporemos detalhadamente o uso e o sentido da terminologia empregada por Espinosa ao longo de suas explicações. Subsidiariamente, em apêndice, fornecemos, de maneira espelhada, (...) o original holandês da carta e nossa tradução para o português. (shrink)

Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited. In this work we propose a library for benchmarking Girard's (propositional) intuitionistic linear logic. For a quick bootstrapping of the collection of problems, and for discussing the selection of relevant problems and understanding their meaning as linear logic theorems, we use translations of the collection of Kleene's intuitionistic theorems in the (...) traditional monograph "Introduction to Metamathematics". We analyze four different translations of intuitionistic logic into linear logic and compare their proofs using a linear logic based prover with focusing. In order to enhance the set of problems in our library, we apply the three provability-preserving translations to the propositional benchmarks in the ILTP Library. Finally, we generate a comprehensive set of reachability problems for Petri nets and encode such problems as linear logic sequents, thus enlarging our collection of problems. (shrink)

The geometric system of deduction called N-Graphs was introduced by de Oliveira in 2001. The proofs in this system are represented by means of digraphs and, while its derivations are mostly based on Gentzen's sequent calculus, the system gets its inspiration from geometrically based systems, such as the Kneales' tables of development, Statman's proofs-as-graphs, Buss' logical flow graphs, and Girard's proof-nets. Given that all these geometric systems appeal to the classical symmetry between premises and conclusions, providing an intuitionistic version of (...) any of these is an interesting exercise in extending the range of applicability of the geometric system in question. In this article we produce an intuitionistic version of N-Graphs, based on Maehara's LJ' system, as described by Takeuti. Recall that LJ' has multiple conclusions in all but the essential intuitionistic rules, e.g., implication right and negation right. We show soundness and completeness of our intuitionistic N-Graphs with respect to LJ'. We also discuss how we expect to extend this work to a version of N-Graphs corresponding to the intuitionistic logic system FIL (Full Intuitionistic Logic) of de Paiva and Pereira and sketch future developments. (shrink)

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still maintaining valid (...) L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

We provide a strongly complete infinitary proof system for hybrid logic. This proof system can be extended with countably many sequents. Thus, although these logics may be non-compact, strong completeness proofs are provided for infinitary hybrid versions of non-compact logics like ancestral logic and Segerberg’s modal logic with the bounded chain condition. This extends the completeness result for hybrid logics by Gargov, Passy, and Tinchev.

Resumo: No presente artigo, discutiremos os aspectos filosóficos de teorias de conjuntos paraconsistentes. A fim de ilustrar nossas considerações de modo mais concreto, abordaremos uma nova teoria de conjuntos baseada em um sistema bem conhecido de Quine e em um cálculo paraconsistente.Palavras-chave: existência, contradição, lógica e paraconsistência.: In the present paper we deal with the philosophical aspects of paraconsistent set theories. In order to illustrate our points more concretely, we will discuss new paraconsistent set theory based both on Quine's (...) well-known system and on a paraconsistent calculus.Keywords: existence, contradiction, logic and paraconsistency. (shrink)

Resumo: Apresentamos uma abordagem geral da demonstração de completude de cálculos lógicos abstratos por meio da noção de valoração e de um resultado devido a A. Lindenbaum.: We present a general approach to the proof the completeness of abstract logical calculi through the notion of valuation and of a result due to A. Lindenbaum.

The inversion principle for logical rules expresses a relationship between introduction and elimination rules for logical constants. Hallnäs & Schroeder-Heister proposed the principle of definitional reflection, which embodies basic ideas of inversion in the more general context of clausal definitions. For the context of admissibility statements, this has been further elaborated by Schroeder-Heister. Using the framework of definitional reflection and its admissibility interpretation, we show that, in the sequent calculus of minimal propositional logic, the left introduction rules are admissible when (...) the right introduction rules are taken as the definitions of the logical constants and vice versa. This generalizes the well-known relationship between introduction and elimination rules in natural deduction to the framework of the sequent calculus. (shrink)

Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...) semantic generalizations – are addressed. Finally, I’ll introduce the case studies that I’ll be dealing with in part II. Chapter 2 is concerned with the origins and development of Jaśkowski’s discussive logic. The main idea of this chapter is to systematize the various stages of the development of discussive logic related researches from two different angles, i.e., its connections to modal logics and its proof theory, by highlighting virtues and vices. Chapter 3 focuses on the Gentzen-style proof theory of discussive logic, by providing a characterization of it in terms of labelled sequent calculi. Chapter 4 deals with the Gentzen-style proof theory of relevant logics, again by employing the methodology of labelled sequent calculi. This time, instead of working with a single logic, I’ll deal with a whole family of them. More precisely, I’ll study in terms of proof systems those relevant logics that can be characterised, at the semantic level, by reduced Routley-Meyer models, i.e., relational structures with a ternary relation between states and a unique base element. Chapter 5 investigates the proof theory of a modal expansion of intuitionistic propositional logic obtained by adding an ‘actuality’ operator to the connectives. This logic was introduced also using Gentzen sequents. Unfortunately, the original proof system is not cut-free. This chapter shows how to solve this problem by moving to hypersequents. Chapter 6 concludes the investigations and discusses the future of the research presented throughout the dissertation. (shrink)

In this paper we are going to examine intuitionistic sequent calculus and its negation rules. We state new negation rules defining, in this way, a new sequent system. It will be used to clarify Gentzen's NJ and LJ systems isomorphism. These new negation rules are a direct reading of new natural deduction negation rules obtained by a slight modification of NJ rules. We also show that the new system is equivalent to LJ and that the Hauptsatz holds for it.

A história do pensamento ocidental, desde seus primórdios na Grécia Antiga até os tempos atuais, é transpassada pela questão de Deus, que mantém a sua relevância mesmo no contexto pós-metafísico no qual estamos inseridos. A busca pelo significado derradeiro da existência humana justapõe a questão do homem à questão de Deus, que adquire, dessa forma, um status imperativo. Mas, como articular o discurso sobre Deus na atual conjuntura, caracterizada por uma visão materialista e imediatista da existência humana? Em nossa reflexão, (...) buscamos analisar as perspectivas da linguagem em relação à abordagem de Deus. Verificamos a impossibilidade da utilização de uma linguagem determinativa, com pretensões de definições últimas, no discurso sobre o Absoluto, visto que a experiência de Deus suscita múltiplas representações, sendo todas elas visões parciais de uma realidade inacessível ao cálculo racional. Diante disso, buscamos percorrer a via delineada por Emmanuel Levinas, que não se apressa em nomear o Infinito, mas aborda sua significação a partir da trama ética. Consideramos esperançosa tal abordagem, frente aos desafios que se apresentam nos tempos contemporâneos. Palavras-chave : Deus; cálculo racional; ética; Levinas.The history of western thought, since its beginning in ancient Greece up to now, is surrounded by God, who has kept his relevance even in the post - metaphysical context in which we are in. The ultimate search for the real meaning of human existence juxtaposes mankind and God, therefore it acquires an imperative status. However, how does one formulate the speech about God nowadays, when there is a materialistic view of human existence? In this reflection, we intend to analyze the perspectives of language in relation to God. It is identified the impossibility of use of certainty in language, claiming correct definitions in the speech about The Absolute, once that the experience of God raises multiple interpretations, and all of them are partial views of an inaccessible reality to the rationale. Therefore, we tend to follow Emmanuel Levinas’ line of thought which is not in a hurry to name the Infinity, but deals with its meaning through ethics. Such thought is considered to be hopeful regarding the challenges that appear in the contemporary times. Key words : God; rational calculation; ethics; Levinas. (shrink)

Much has been said about intuitionistic and classical logical systems since Gentzen’s seminal work. Recently, Prawitz and others have been discussing how to put together Gentzen’s systems for classical and intuitionistic logic in a single unified system. We call Prawitz’ proposal the Ecumenical System, following the terminology introduced by Pereira and Rodriguez. In this work we present an Ecumenical sequent calculus, as opposed to the original natural deduction version, and state some proof theoretical properties of the system. We reason that (...) sequent calculi are more amenable to extensive investigation using the tools of proof theory, such as cut-elimination and rule invertibility, hence allowing a full analysis of the notion of Ecumenical entailment. We then present some extensions of the Ecumenical sequent system and show that interesting systems arise when restricting such calculi to specific fragments. This approach of a unified system enabling both classical and intuitionistic features sheds some light not only on the logics themselves, but also on their semantical interpretations as well as on the proof theoretical properties that can arise from combining logical systems. (shrink)

The present report is a, somewhat lengthy, addendum to "A new deconstructive logic: linear logic," where the elimination of cuts from derivations in sequent calculus for classical logic was studied ‘from the point of view of linear logic’. To that purpose a formulation of classical logic was used, that - as in linear logic - distinguishes between multiplicative and additive versions of the binary connectives.The main novelty here is the observation that this type-distinction is not essential: we can allow classical (...) sequent derivations to use any combination of additive and multiplicative introduction rules for each of the connectives, and still have strong normalization and confluence of tq-reductions.We give a detailed description of the simulation of tq-reductions by means of reductions of the interpre- tation of any given classical proof as a proof net of PN2 (the system of second order proof nets for linear logic), in which moreover all connectives can be taken to be of one type, e.g., multiplicative.We finally observe that dynamically the different logical cuts, as determined by the four possible combinations of introduction rules, are independent: it is not possible to simulate them internally, i.e., by only one specific combination, and structural rules. (shrink)

In (Béziau 2001), Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract "core" of logics in general, where logical syntax and semantics are "two sides of the same coin". Thecentral suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic (...) (without invoking the role of classical negation in the completeness proof). However, the reduction to bivaluation may be a side effect of the architecture of ordinary sequents, which is both overly restrictive, and entails certain expressive restrictions over the language. This paper provides an expansion of Béziau’s completeness results for logics, by showing that there is a natural extension of that line of thinking to n-sided sequent constructions. Through analogical techniques to Béziau’s construction, it is possible, in this setting, to construct abstract soundness and completeness results for n-valued logics.En (Béziau 2001), Béziau ofrece un recurso para combinar el cálculo de secuentes de Gentzen con la teoría semántica general de bivaluaciones. Al hacer esto, según Béziau, es posible construir el “núcleo” abstracto de la lógica en general, donde sintaxis y semántica son las dos caras de una misma moneda. La sugerencia clave es que, mediante una modificación de la noción de consistencia máxima, es posible probar la corrección y completud de cualquier lógica normal (sin invocar la función de la negación clásica en la prueba de completud). Sin embargo, la reducción a bivaluaciones puede ser un efecto colateral de la arquitectura de los secuentes ordinarios, que es abiertamente restrictiva y entraña determinadas restricciones expresivas sobre el lenguaje. Este artículo ofrece una expansión de los resultados de completud de Béziau para la lógica, mostrando que existe una extensión natural de esta línea de pensamiento a construcciones de secuentes de n lados. Mediante técnicas análogas a la construcción de Béziau, en este marco es posible construir resultados abstractos decorrección y completud para la lógica n-valuada. (shrink)

Este trabajo se encuadra dentro de una nueva visión de la lógica de Leibniz, la cual pretende mostrar que sus escritos fueron ricos no solamente en proyectos ambiciosos (Característica Universal, Combinatoria, Mathesis) sino también en desarrollos lógico-matematicos concretos. Se demuestra que su “Caracteristica Numerica” que asigna pares de números a las proposiciones categóricas es una semántiea para la cual la silogística aristotélica es correcta y completa, y que el sistema algebraico presentado en Fundamentos de un Cálculo Lógico es una (...) lógica algebraica similar a la de Boole.This work is a contribution to a new view of Leibniz’s logic, pretending to show that his writings were not only rich in projects (Characteristica, Combinatoria, Mathesis), but also in concrete logico-mathematical developments. We prove that his “Numerical Characteristic” assigning pairs of numbers to terms of categorical propositions, is a complete and correct semantics for aristotelian syllogistic, and the algebraic system presented in Fundamentals of Logical Calculus is essentially a complete version of boolean algebraic logic. (shrink)

O presente artigo discute as noções de cálculo e medida na obra de Nietzsche, mais especificamente na transição do seu período inicial para o período intermediário. Com isso, nossa intenção é explicitar como tais noções que soam tão pouco dionisíacas – e consequentemente, nietzschianas – podem fazer parte do conjunto da obra de Nietzsche e, mais ainda, serem essenciais para a compreensão de seu pensamento. Para que esse objetivo fosse alcançado, foram necessários os desdobramentos de conceitos como paixões e (...) criação na obra nietzschiana, fazendo reaparecer características do conceito de apolíneo, que são praticamente despercebidos uma vez que o filósofo combina seus dois conceitos anteriores. Porém, ao fazer isso, ele compartilha conosco sua ideia de “criar a si mesmo como obra de arte”. Por fim, tentamos deixar claro que quando introduzimos tais noções como cálculo e medida em sua filosofia, isso jamais o faz parecer um filósofo racionalista ou moralista, isto é, alguém que busque apresentar e estabelecer determinadas regras e normas de conduta consideradas apropriadas. (shrink)

A contraction-free and cut-free sequent calculus \ for semi-De Morgan algebras, and a structural-rule-free and single-succedent sequent calculus \ for De Morgan algebras are developed. The cut rule is admissible in both sequent calculi. Both calculi enjoy the decidability and Craig interpolation. The sequent calculi are applied to prove some embedding theorems: \ is embedded into \ via Gödel–Gentzen translation. \ is embedded into a sequent calculus for classical propositional logic. \ is embedded into the sequent calculus \ for intuitionistic (...) propositional logic. (shrink)

Este trabajo se encuadra dentro de una nueva visión de la lógica de Leibniz, la cual pretende mostrar que sus escritos fueron ricos no solamente en proyectos ambiciosos sino también en desarrollos lógico-matematicos concretos. Se demuestra que su “Caracteristica Numerica” que asigna pares de números a las proposiciones categóricas es una semántiea para la cual la silogística aristotélica es correcta y completa, y que el sistema algebraico presentado en Fundamentos de un Cálculo Lógico es una lógica algebraica similar a (...) la de Boole.This work is a contribution to a new view of Leibniz’s logic, pretending to show that his writings were not only rich in projects, but also in concrete logico-mathematical developments. We prove that his “Numerical Characteristic” assigning pairs of numbers to terms of categorical propositions, is a complete and correct semantics for aristotelian syllogistic, and the algebraic system presented in Fundamentals of Logical Calculus is essentially a complete version of boolean algebraic logic. (shrink)

Este trabajo se encuadra dentro de una nueva visión de la lógica de Leibniz, la cual pretende mostrar que sus escritos fueron ricos no solamente en proyectos ambiciosos sino también en desarrollos lógico-matematicos concretos. Se demuestra que su “Caracteristica Numerica” que asigna pares de números a las proposiciones categóricas es una semántiea para la cual la silogística aristotélica es correcta y completa, y que el sistema algebraico presentado en Fundamentos de un Cálculo Lógico es una lógica algebraica similar a (...) la de Boole.This work is a contribution to a new view of Leibniz’s logic, pretending to show that his writings were not only rich in projects, but also in concrete logico-mathematical developments. We prove that his “Numerical Characteristic” assigning pairs of numbers to terms of categorical propositions, is a complete and correct semantics for aristotelian syllogistic, and the algebraic system presented in Fundamentals of Logical Calculus is essentially a complete version of boolean algebraic logic. (shrink)

This article studies Leibniz’s treatment of infinitesimals: their application to the calculus and his opinion that they did not exist. In partial agreement with Brunschvicg’s and Ishiguro’s commentaries on the paradoxical status of Leibniz´s infinitesimals, this study proposes a synthesis of both..

En este artículo consideraré los puntos de vista de Newton sobre el método matemático. Newton nunca escribió en extenso sobre este tema, sin embargo, en sus escritos polémicos contra Descartes y Leibniz expresó la idea de que su método era superior a los propuestos por el francés y el alemán. Considerar estos escritos nos puede ayudar a comprender el papel que Newton le atribuyó al álgebra y al cálculo en su pensamiento matemático.

The probability calculus is very often used in the philosophy of science in order to support or to analyse epistemological points of view. The aim of this paper is to present in a summary the usual axioms of this calculus, as weIl as its most common consequences and theorems, which the philosopher of science in his arguments ressorts to.

Normal 0 21 false false false PT-BR X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Tabela normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Este artigo investiga alguns usos da metáfora da linguagem como cálculo em Wittgenstein. A metáfora do cálculo emerge, nos anos 30, numa interlocução com o referencialista, e é ali instrumental na recondução do olhar filosófico para (...) os usos efetivos do simbolismo linguístico. Contudo, foi levada longe demais, ao sugerir uma imagem da linguagem composta apenas de inferências à maneira dos sistemas de regras fechados. Isto embargaria certa expansão pragmática do contexto criterial da análise conceitual. Mas a aplicabilidade do símile do cálculo não é invalidada. A metáfora será reativada em manuscritos posteriores, sempre e quando puder servir aos mesmos propósitos do período intermediário, à medida que o ambiente dialógico convoque novas vozes dogmaticamente referencialistas. Ainda assim, é nos manuscritos intermediários que melhor se esclarece o seu funcionamento. Tal movimento exemplifica, por fim, um método filosófico que não procede por meio da superação de problemas à maneira científica. (shrink)