找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Epistemology versus Ontology; Essays on the Philos P. Dybjer,Sten Lindstr?m,G. Sundholm Book 2012 Springer Science+Business Media Dordrecht

[復(fù)制鏈接]
樓主: retort
11#
發(fā)表于 2025-3-23 11:35:37 | 只看該作者
Program Testing and the Meaning Explanations of Intuitionistic Type Theoryes. In particular we propose that testing for impredicative type theory should be based on the evaluation of open expressions. This is in contrast to our testing semantics for Martin-L?f’s predicative intuitionistic type theory which is based on the evaluation of closed expressions.
12#
發(fā)表于 2025-3-23 15:47:30 | 只看該作者
13#
發(fā)表于 2025-3-23 18:33:59 | 只看該作者
14#
發(fā)表于 2025-3-24 00:52:35 | 只看該作者
Wittgenstein’s Diagonal Argument: A Variation on Cantor and Turing the remark “Turings ‘machines’: these machines are humans who calculate. And one might express what he says also in the form of games”. Though most of the extant literature interprets the remark as a criticism of Turing’s philosophy of mind (that is, a criticism of forms of computationalist or func
15#
發(fā)表于 2025-3-24 06:10:59 | 只看該作者
16#
發(fā)表于 2025-3-24 07:37:08 | 只看該作者
The “Middle Wittgenstein” and Modern Mathematics beginning of the 1930s when he starts to emphasise the autonomy of the grammar of language and to talk about grammatical pictures and language games as objects of comparison. By examining certain crucial features in this change in Wittgenstein’s thinking, it will be shown that he received decisive
17#
發(fā)表于 2025-3-24 11:56:08 | 只看該作者
A Computational Interpretation of Forcing in Type Theoryt types. The argument was constructive, and so contains implicitly an algorithm which computes a witness that a given functional is uniformly continuous. We present here such an algorithm, which provides a possible computational interpretation of forcing.
18#
發(fā)表于 2025-3-24 17:20:46 | 只看該作者
Program Testing and the Meaning Explanations of Intuitionistic Type Theorytionistic type theory are viewed as conjectures which can be tested in order to be corroborated or refuted. This point of view provides a new perspective on the meaning of hypothetical judgements, since tests for such judgements need methods for generating inputs. Among other things, we need to gene
19#
發(fā)表于 2025-3-24 23:03:10 | 只看該作者
20#
發(fā)表于 2025-3-25 01:58:48 | 只看該作者
Machine Translation and Type Theoryrnate. Grammatical Frameword (GF) is introduced as an approach that uses type theory to provide high-quality translation between multiple languages. GF translation is fundamentally grammar-based but can be combined with statistical methods such as learning translation models from a corpus and rankin
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 01:25
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
扶风县| 建宁县| 鞍山市| 台南市| 榕江县| 布拖县| 松潘县| 武冈市| 永福县| 阳朔县| 安吉县| 通化县| 辉县市| 苏尼特左旗| 泸定县| 龙海市| 蚌埠市| 望奎县| 西乡县| 会同县| 建平县| 宁强县| 南京市| 临高县| 宁海县| 宁蒗| 白玉县| 扬州市| 鹤峰县| 通榆县| 独山县| 泰来县| 菏泽市| 海阳市| 兰西县| 华蓥市| 清原| 巢湖市| 洛川县| 凌源市| 宝丰县|