Tarski's Theory of the Formal Correctness of Definitions

被引:0
|
作者
Hitchcock, David [1 ]
机构
[1] McMaster Univ, Dept Philosophy, Hamilton, ON L8S 4K1, Canada
关键词
Definitions; Formal correctness; Tarski; Suppes; Ajdukiewicz; Lesniewski;
D O I
10.1007/s10992-023-09729-0
中图分类号
B81 [逻辑学(论理学)];
学科分类号
010104 ; 010105 ;
摘要
In his 1933 monograph on the concept of truth, Alfred Tarski claimed that his definition of truth satisfied "the usual conditions of methodological correctness", which in a 1935 article he identified as consistency and back-translatability. Following the rules of defining for an axiomatized theory was supposed to ensure satisfaction of the two conditions. But Tarski neither explained the two conditions nor supplied rules of defining for any axiomatized theory. We can make explicit what Tarski understood by consistency and back-translatability, with the help of (1) an account by Ajdukiewicz (1936) of the criteria underlying the practice of articulating rules of defining for axiomatized theories and (2) a critique by Frege (1903) of definitions that conjure an object into existence as that which satisfies a specified condition without first proving that exactly one object does so. I show that satisfaction of the conditions of consistency and back-translatability as thus explained is guaranteed by the rules of defining articulated by Lesniewski (1931) for an axiomatized system of propositional logic. I then construct analogous rules of defining for the theory within which Tarski developed his definition of truth. Tarski's 32 definitions in this theory occasionally violate these rules, but the violations are easily repaired. I argue that the Lesniewski-Ajdukiewicz theory of formal correctness of definitions within which Tarski worked is superior in some respects to the widely accepted analogous theory articulated by Suppes (1957).
引用
收藏
页码:181 / 221
页数:41
相关论文
共 50 条
  • [21] Formal Correctness of a Quadratic Unification Algorithm
    José-Luis Ruiz-Reina
    Francisco-Jesús Martín-Mateos
    José-Antonio Alonso
    María-José Hidalgo
    [J]. Journal of Automated Reasoning, 2006, 37 : 67 - 92
  • [22] FORMAL CORRECTNESS PROOFS OF A NONDETERMINISTIC PROGRAM
    UPFAL, E
    [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (02) : 86 - 92
  • [23] FORMAL ANALYSIS OF CORRECTNESS OF BEHAVIORAL TRANSFORMATIONS
    MCFARLAND, MC
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 1993, 2 (03) : 231 - 257
  • [24] Formal correctness of supply chain design
    Leukel, Joerg
    Sugumaran, Vijayan
    [J]. DECISION SUPPORT SYSTEMS, 2013, 56 : 288 - 299
  • [25] Formal Proof: Reconciling Correctness and Understanding
    Calude, Cristian S.
    Mueller, Christine
    [J]. INTELLIGENT COMPUTER MATHEMATICS, PROCEEDINGS, 2009, 5625 : 217 - 232
  • [26] Formal correctness of a quadratic unification algorithm
    Ruiz-Reina, Jose-Luis
    Martin-Mateos, Francisco-Jesus
    Alonso, Jose-Antonio
    Hidalgo, Maria-Jose
    [J]. JOURNAL OF AUTOMATED REASONING, 2006, 37 (1-2) : 67 - 92
  • [27] Formal description of software dynamic correctness
    Ma, Yanfang
    Zhang, Min
    Chen, Yixiang
    [J]. Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2013, 50 (03): : 626 - 635
  • [28] Formal Correctness of Conflict Detection for Firewalls
    Capretta, Venanzio
    Stepien, Bernard
    Felty, Amy
    Matwin, Stan
    [J]. FMSE'07: PROCEEDINGS OF THE 2007 ACM WORKSHOP ON FORMAL METHODS IN SECURITY ENGINEERING, 2007, : 22 - 30
  • [29] Formal specifications and test: Correctness and oracle
    LeGall, P
    Arnould, A
    [J]. RECENT TRENDS IN DATA TYPE SPECIFICATION, 1996, 1130 : 342 - 358
  • [30] Formal Correctness Proof for DPLL Procedure
    Maric, Filip
    Janicic, Predrag
    [J]. INFORMATICA, 2010, 21 (01) : 57 - 78