Nicolas Clerbout
Universidad de Valparaiso, Philosophy, Department Member
- Professor of Philosophy and Logician at University of Valparaíso, Chile Springer "Logic, Epistemology and the Unity ... moreProfessor of Philosophy and Logician at University of Valparaíso, Chile
Springer "Logic, Epistemology and the Unity of Science" series: https://www.springer.com/series/6936
College Publications "Dialogues and Games of Logic" series: http://collegepublications.co.uk/dialogues/edit
Text to the Joint Talk at the IHPST-Paris1. Immanent Reasoning and CTT: building on Göran Sundholm’s Insight on Dialogical Logic Nicolas Clerbout and Shahid Rahman. Invited speaker to the international workshp "Formalisation vs.... more
Text to the Joint Talk at the IHPST-Paris1. Immanent Reasoning and CTT: building on Göran Sundholm’s Insight on Dialogical Logic Nicolas Clerbout and Shahid Rahman. Invited speaker to the international workshp "Formalisation vs. Meaning in Mathematics: Formal theories as tools for understanding" Themes from the work of Göran Sundholm
It provides an overview of present and past work on dialogical logic, passing from the work on non classical logics by changing some structural rules, to the recent development on the dialogical framework for fully interpreted languages
(as developed in Constructive Type Theory) called "Immanent Reasoning"
It provides an overview of present and past work on dialogical logic, passing from the work on non classical logics by changing some structural rules, to the recent development on the dialogical framework for fully interpreted languages
(as developed in Constructive Type Theory) called "Immanent Reasoning"
Research Interests: Computer Science, Philosophy, Philosophy Of Language, Epistemology, Philosophy of Science, and 15 moreLogic, Pragmatics, Semantics, Philosophy Of Mathematics, Theories of Meaning, Deductive reasoning, Philosophy of Logic, Argumentation Theory, Argumentation Theory and Critical Thinking, Epistemology of the Social Sciences, Epistemología, Dialogical logic, Argumentación Razones Razonamiento Lógica, Teoría de la Argumentación, and Teoria Da Argumentação
Research Interests:
Research Interests: Cognitive Science, Computer Science, Philosophy, Philosophy Of Language, Epistemology, and 29 morePhilosophy of Science, Logic, Informatics, Language and Social Interaction, Pragmatics, Semantics, Philosophy Of Mathematics, Semantics/Pragmatics, Philosophical Logic, Jaakko Hintikka, Philosophy of Logic, Wittgenstein, Linguistics, Dialectic, Formal Semantics/Pragmatics, Formal Semantics, Lingüística, Anaphora, Games, Philosophie, Informatica, Epistemología, Filosofía, Robert Brandom, Ciencia da computacao, Formal semantics, Logic (proof theory), Dialogical logic, Formal Semantics (In Linguistics, In Philosophy, of Programming Languages), and Computational Linguistics & Malayalam Computing
We introduce the first study of a topic usually ignored when it comes to the metatheory of dialogical games, namely the dialogical problem of decidability. Our explanation and elucidation of the problem is done in dialogical terms only:... more
We introduce the first study of a topic usually ignored when it comes to the metatheory of dialogical games, namely the dialogical problem of decidability. Our explanation and elucidation of the problem is done in dialogical terms only: it does not rest on equivalence results with other frameworks. Our analysis shows the decisive role for this topic of the mechanism of repetition ranks which was recently introduced to ensure finiteness of plays in dialogical games. The notion of repetition ranks thus turns out to be a fruitful and clarifying tool in metatheoretical studies on the dialogical framework.
We present a new proof of soundness/completeness of tableaux with respect to dialogical games in Classical First-Order Logic. As far as we know it is the first thorough result for dialogical games where finiteness of plays is guaranteed... more
We present a new proof of soundness/completeness of tableaux with respect to dialogical games in Classical First-Order Logic. As far as we know it is the first thorough result for dialogical games where finiteness of plays is guaranteed by means of what we call repetition ranks.
In classical India, Jain philosophers developed a theory of viewpoints (naya-vāda) according to which any statement is always performed within and dependent upon a given epistemic perspective or viewpoint. The Jainas furnished this... more
In classical India, Jain philosophers developed a theory of viewpoints (naya-vāda) according to which any statement is always performed within and dependent upon a given epistemic perspective or viewpoint. The Jainas furnished this epistemology with an (epistemic) theory of disputation that takes into account the viewpoint in which the main thesis has been stated. The main aim of our paper is to delve into the Jain notion of viewpoint-contextualisation and to develop the elements of a suitable logical system that should offer a reconstruction of the Jainas’ epistemic theory of disputation. A crucial step of our project is to approach the Jain theory of disputation with the help of a theory of meaning for logical constants based on argumentative practices called dialogical logic. Since in the dialogical framework the meaning of the logical constants is given by the norms or rules for their use in a debate, it provides a meaning theory closer to the Jain context-sensitive disputation theory than the main-stream formal model-theoretic semantics.
"L'approche dialogique fournit une théorie de la signification qui se distingue des paradigmes dominants de la théorie des modèles et de la théorie de la preuve. Du point de vue dialogique, la signification est donnée par l'usage au sein... more
"L'approche dialogique fournit une théorie de la signification qui se distingue des paradigmes dominants de la théorie des modèles et de la théorie de la preuve. Du point de vue dialogique, la signification est donnée par l'usage au sein de débats argumentatifs, qui sont étudiés comme des jeux entre deux joueurs. Dans ce travail nous présentons les notions fondamentales de l'approche, et nous effectuons des incursions dans la metathéorie des jeux dialogiques.
Notre travail se distingue notamment par trois aspects : la notion de rang de répétition introduite pour garantir de manière homogène la finitude des parties, l'importance donnée aux actes de langage dans l'approche dialogique de la signification et le rôle accordé à la perspective des formes extensives des jeux.
Pour ce qui est de l'analyse metathéorique, nous présentons la première démonstration de la fiabilité et de la complétude de la méthode des tableaux vis-à-vis des jeux dialogiques à parties finies. Nous donnons également la première analyse de la manifestation dialogique de la décidabilité (ou non) d'une logique. Notre analyse met notamment en avant le lien profond entre la décidabilité et la gestion des comportements répétitifs dans les jeux d'argumentation."
Notre travail se distingue notamment par trois aspects : la notion de rang de répétition introduite pour garantir de manière homogène la finitude des parties, l'importance donnée aux actes de langage dans l'approche dialogique de la signification et le rôle accordé à la perspective des formes extensives des jeux.
Pour ce qui est de l'analyse metathéorique, nous présentons la première démonstration de la fiabilité et de la complétude de la méthode des tableaux vis-à-vis des jeux dialogiques à parties finies. Nous donnons également la première analyse de la manifestation dialogique de la décidabilité (ou non) d'une logique. Notre analyse met notamment en avant le lien profond entre la décidabilité et la gestion des comportements répétitifs dans les jeux d'argumentation."
Research Interests:
Dentro de la Teoría Constructiva de Tipos (en adelante TCT) las constantes lógicas son interpretadas a través de la correspondencia Curry-Howard entre proposiciones y conjuntos. Una proposición es interpretada como un conjunto cuyos... more
Dentro de la Teoría Constructiva de Tipos (en adelante TCT) las constantes lógicas son interpretadas a través de la correspondencia Curry-Howard entre proposiciones y conjuntos. Una proposición es interpretada como un conjunto cuyos elementos representan las pruebas de la proposición. También es posible ver un conjunto como la descripción de un problema, en un sentido similar a la explicación de Kolmogorov sobre el cálculo proposicional intuicionista. En particular un conjunto puede ser visto como la especificación de la programación de un problema: los elementos del conjunto son entonces los programas que satisfacen la especificación (Martin-Löf 1984, p. 7). Más aún en TCT, los conjuntos son también entendidos como tipos en el cual las proposiciones pueden ser vistas como tipos de datos (data-types) o tipos de pruebas (proof-types) . Partiremos con la introducción de los principios fundamentales de la TCT. Y luego revisaremos las reglas de la lógica intuicionista de predicados en TCT