Semantic values in higher-order semantics

被引:0
|
作者
Stephan Krämer
机构
[1] University of Hamburg,Nominalizations Research Group, Department of Philosophy
来源
Philosophical Studies | 2014年 / 168卷
关键词
Higher-order quantification; Semantics; Semantic values; Inexpressibility; Absolute generality;
D O I
暂无
中图分类号
学科分类号
摘要
Recently, some philosophers have argued that we should take quantification of any (finite) order to be a legitimate and irreducible, sui generis kind of quantification. In particular, they hold that a semantic theory for higher-order quantification must itself be couched in higher-order terms. Øystein Linnebo has criticized such views on the grounds that they are committed to general claims about the semantic values of expressions that are by their own lights inexpressible. I show that Linnebo’s objection rests on the assumption of a notion of semantic value or contribution which both applies to expressions of any order, and picks out, for each expression, an extra-linguistic correlate of that expression. I go on to argue that higher-orderists can plausibly reject this assumption, by means of a hierarchy of notions they can use to describe the extra-lingustic correlates of expressions of different orders.
引用
收藏
页码:709 / 724
页数:15
相关论文
共 50 条
  • [1] Semantic values in higher-order semantics
    Kraemer, Stephan
    [J]. PHILOSOPHICAL STUDIES, 2014, 168 (03) : 709 - 724
  • [2] Higher-order semantics and extensionality
    Benzmüller, C
    Brown, CE
    Kohlhase, M
    [J]. JOURNAL OF SYMBOLIC LOGIC, 2004, 69 (04) : 1027 - 1088
  • [3] SEMANTICS OF HIGHER-ORDER RECURSION SCHEMES
    Adamek, Jiri
    Milius, Stefan
    Velebil, Jiri
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2011, 7 (01)
  • [4] Relational semantics for higher-order programs
    Aboul-Hosn, Kamal
    Kozen, Dexter
    [J]. MATHEMATICS OF PROGRAM CONSTRUCTION, 2006, 4014 : 29 - 48
  • [5] Semantics of Higher-Order Recursion Schemes
    Adamek, Jiri
    Milius, Stefan
    Velebil, Jiri
    [J]. ALGEBRA AND COALGEBRA IN COMPUTER SCIENCE, PROCEEDINGS, 2009, 5728 : 49 - +
  • [6] Game semantics for higher-order concurrency
    Laird, J.
    [J]. FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, Proceedings, 2006, 4337 : 417 - 428
  • [7] A denotational semantics of Simulink with higher-order UTP
    Xu, Xiong
    Zhan, Bohua
    Wang, Shuling
    Talpin, Jean-Pierre
    Zhan, Naijun
    [J]. JOURNAL OF LOGICAL AND ALGEBRAIC METHODS IN PROGRAMMING, 2023, 130
  • [8] TOPOS SEMANTICS FOR HIGHER-ORDER MODAL LOGIC
    Awodey, Steve
    Kishida, Kohei
    Kotzsch, Hans-Christoph
    [J]. LOGIQUE ET ANALYSE, 2014, (228) : 591 - 636
  • [9] Semantics of Higher-Order Probabilistic Programs with Conditioning
    Dahlqvist, Fredrik
    Kozen, Dexter
    [J]. PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (04):
  • [10] AN ALGEBRAIC SEMANTICS OF HIGHER-ORDER TYPES WITH SUBTYPES
    QIAN, ZY
    [J]. ACTA INFORMATICA, 1993, 30 (06) : 569 - 607