课题基金 / 基金详情

Falsity and refutations: Understanding the negative side of logic

Falsity and refutations: Understanding the negative side of logic
虚假与反驳:理解逻辑的消极面
批准号:
397512418
负责人:
Dr. Luca Tranchini
金额:
$0.0万
依托单位:
依托单位国家:
德国
项目类别:
Research Grants
财政年份:
2018
资助国家:
德国
项目状态:
已结题
起止时间:
2017-12-31 至 2021-12-31

项目摘要

项目成果

Dr. Luca Tranchini的其他基金

相似基金

相关文献

中文摘要
翻译
尽管谬误和反驳的概念发挥了核心作用,但到今天为止,对于哪一种概念应该是它们在逻辑上的正确理解,仍然没有达成一致。在最普遍的观点中,与真理、证明和断言相比,虚假、反驳和否认只起到辅助作用。这种观点遭到了一些作者的反对,他们呼吁平等对待积极和消极的观念。然而,如何做到这一点仍是争议的对象。该项目的目标是提出一种新的逻辑图景,以正视其消极的一面。它的主要贡献将是对反驳概念本身的分析,即独立于证据概念。该项目将从批评传统观点开始,在传统观点中,消极概念从属于积极概念,并提议在现实主义的意义概念中确定这种观点的来源。在这样的概念上,尽管现实的一部分--即事实--对应于真实的句子,但没有什么对应于虚假的句子。根据目前的另一种观点,这些观点更多地依赖于“建设性”的意义概念,主张一个命题是通过拥有它的证据来证明的,而否认一个命题是通过拥有对它的反驳来证明的。传统概念和这些不同观点的共同弱点是,尽管蕴涵表达了逻辑中命题之间最重要的一种关系,但通过参照真(证明)的概念来表述蕴涵‘如果A则B’为假(被驳斥)的条件:如果A为真(被证明),则B为假(被驳斥)。本项目的主要部分将包括提供一种新的对反驳的操作理解,类似于对基本直觉主义证明的操作理解。证明的实用概念是建立在逻辑和计算机科学之间紧密联系的‘柯里-霍华德对应’的基础上的,因为形式推导可以被视为编码一种算法,即计算机程序的抽象表示,该算法以假设的证明为输入,产生结论的证明作为输出。为了在这种情况下使反驳的概念准确,我们将展示如何将“对偶程序”与形式推导相关联,即将对结论的反驳作为输入并产生对假设的(集体)反驳作为输出的程序。在对反驳的拟议理解的基础上,我们将调查逻辑系统在哪些条件下能够被理解为“证明的逻辑”、“反驳的逻辑”或两者的综合。此外,我们还将介绍开发新的逻辑系统的工具,在这些系统中,证明和反驳以不同的方式编码,并由不同类型的否定运算符连接。
英文摘要
In spite of the central role played by the notions of falsity and refutation, as of today there is no agreement on which should be their correct understanding in logic. On the most common view, falsity, refutation and denial play a merely ancillary role compared to their positive counterparts, truth, proof and assertion. Such a view has been opposed by some authors , who called for treating positive and negative notions on a par. How this should be done, however, is still the object of controversies. The goal of the project is to propose a novel picture of logic that does justice to its negative side. Its major contribution will be an analysis of the notion of refutation on its own, i.e. independently of the notion of proof. The project will begin by criticising the traditional view, on which negative notions are subordinated to positive ones, and by proposing to identify the source of this view in a realist conception of meaning. On such a conception, whereas portions of reality - i.e. facts - correspond to true sentences, nothing corresponds to false ones. On current alternative views, which rather rely on a `constructive' conception of meaning, the assertion of a proposition is justified by the possession of a proof of it, and the denial of a proposition is justified by the possession of a refutation of it. The common weakness of both the traditional conception and these alternative views is that, although implication expresses the most important kind of relation between propositions in logic, the conditions at which an implication `if A then B' is false (refuted) are formulated by making reference to the notion of truth (proof): `if A then B' is false (refuted) whenever A is true (proved) and B is false (refuted).The main part of the project will consists in delivering a novel operational understanding of refutations, analogous to the operational understanding of proofs underlying intuitionism. The operative conception of proofs is based on the `Curry-Howard correspondence', that establishes a close connection between logic and computer science, in that a formal derivation can be seen as encoding an algorithm, i.e. the abstract representation of a computer program, that taken a proof of the assumptions as input yields a proof of the conclusion as output. In order to make the notion of refutation precise in this context, we will show how to associate `dual programs' to formal derivations, i.e. programs that take a refutation of the conclusions as input and yield a (collective) refutation of the assumptions as output.On the basis of the proposed understanding of refutations, we will investigate the conditions at which a logical system lends itself to be understood as a ``logic of proof'', as a ``logic of refutation'', or as a synthesis of the two. Moreover, we will introduce tools for developing new logical systems in which proofs and refutations are encoded in different ways and connected by different kinds of negation operators.
期刊论文(4)
专著(0)
科研奖励(0)
会议论文
Higher-level Inferences in the Strong-Kleene Setting: A Proof-theoretic Approach
强克莱恩环境中的高级推论:证明理论方法
DOI: 10.1007/s10992-021-09639-z
发表时间: 2021
期刊: Journal of Philosophical Logic
影响因子: 1.5
作者: [Luca Tranchini, Pablo Cobreros, Elio La Rosa]
通讯作者: Elio La Rosa
Equality and Apartness in Bi-intuitinistic Logic
双直觉逻辑中的平等与分离
DOI: 10.21146/2074-1472-2021-27-1-82-106
发表时间: 2021
期刊: Logical Investigations
影响因子: --
作者: [Luca Tranchini, Paolo Maffezioli]
通讯作者: Paolo Maffezioli
(I can’t get no) antisatisfaction
(我得不到)反满足
DOI: 10.1007/s11229-020-02570-x
发表时间: 2021
期刊: Synthese
影响因子: 1.5
作者: [Luca Tranchini, Pablo Cobreros, Elio La Rosa]
通讯作者: Elio La Rosa
The Naturality of Natural Deduction (II): On Atomic Polymorphism and Generalized Propositional Connectives
自然演绎的自然性(二):论原子多态性与广义命题联结词
DOI: 10.1007/s11225-021-09964-z
发表时间: 2022
期刊: Studia Logica
影响因子: 0.7
作者: [Luca Tranchini, Paolo Pistone, Mattia Petrolo]
通讯作者: Mattia Petrolo
Logical consequence and paradoxical reasoning
  • 批准号:
    289086941
  • 项目类别:
    Research Grants
  • 资助金额:
    $0.0万
  • 财政年份:
    2015
  • 负责人:
    Dr. Luca Tranchini
  • 依托单位:
Logical consequence. Epistemological and proof-theoretic perspectives.
  • 批准号:
    206616311
  • 项目类别:
    Research Grants
  • 资助金额:
    $0.0万
  • 财政年份:
    2012
  • 负责人:
    Dr. Luca Tranchini
  • 依托单位:
海外基金