DE eng

Search in the Catalogues and Directories

Page: 1 2 3 4 5...195
Hits 1 – 20 of 3.897

1
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2022 (2022)
BASE
Show details
2
Semantics with assignment variables
Silk, Alex. - Cambridge, United Kingdom : Cambridge University Press, 2021
BLLDB
UB Frankfurt Linguistik
Show details
3
Properties and propositions : the metaphysics of higher-order logic
Trueman, Robert. - Cambridge, United Kingdom : Cambridge University Press, 2021
BLLDB
UB Frankfurt Linguistik
Show details
4
Conceptual alternatives: Competition in language and beyond
In: Linguistics & Philosophy ; https://hal.archives-ouvertes.fr/hal-03102612 ; Linguistics & Philosophy, In press (2021)
BASE
Show details
5
Multiplicative Linear Logic from Logic Programs and Tilings
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
BASE
Show details
6
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
7
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
8
A gentle introduction to Girard's Transcendental Syntax for the linear logician
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
Abstract: The Transcendental Syntax is about designing logics with a computational foundation. It suggests a new framework for proof theory where logic (proofs, formulas, truth, .) is no more primitive but computation is. All the logical entities and activities will be presented as formatting on a given model of computation which should be as general, simple and natural as possible. The selected ground for logic in the Transcendental Syntax is a model of computation I call "stellar resolution" which is basically a reformulation logic-free Robinson's first order clausal resolution with a dynamics related to tiling models. An initial goal of the Transcendental Syntax is to retrieve linear logic from this new framework In particular, this model naturally encodes cut-elimination for proof-structures. By using ideas from realisability theory, it is possible to design formulas/types generalising the connectives of linear logic. Finally, generalising ideas from the theory of proof-nets, we able to express an idea unit testing: we can encode a computational object (typically the computational content of a proof) and some tests certifying its logical correctness (that it is indeed a valid proof of some formula).
Keyword: [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]; [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]; ACM: F.: Theory of Computation/F.1: COMPUTATION BY ABSTRACT DEVICES/F.1.1: Models of Computation; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages; ACM: F.: Theory of Computation/F.3: LOGICS AND MEANINGS OF PROGRAMS/F.3.2: Semantics of Programming Languages/F.3.2.1: Denotational semantics; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.0: Computability theory; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.2: Lambda calculus and related systems; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.3: Logic and constraint programming; ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.1: Mathematical Logic/F.4.1.7: Proof theory; Geometry of Interaction; Linear Logic; Models of Computation; Realizability semantics; Semantics
URL: https://hal.archives-ouvertes.fr/hal-02977750v6/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02977750v6/document
https://hal.archives-ouvertes.fr/hal-02977750
BASE
Hide details
9
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
10
Covariant Subtyping Applied to Semantic Predicate Calculi
In: LACL 2021 - Logical Aspects of Computational Linguistics ; https://hal.inria.fr/hal-03542057 ; LACL 2021 - Logical Aspects of Computational Linguistics, Dec 2021, Montpellier (online), France (2021)
BASE
Show details
11
On the habitual verb "pflegen" in German: its use, origin, and development
In: Linguistics. - Berlin [u.a.] : Mouton de Gruyter 59 (2021) 6, 1473-1530
BLLDB
Show details
12
Dialogue Modeling in a Dynamic Framework ; Modélisation dynamique des dialogues
Boritchev, Maria. - : HAL CCSD, 2021
In: https://hal.archives-ouvertes.fr/tel-03541628 ; Computation and Language [cs.CL]. Université de Lorraine; École doctorale IAEM Lorraine - Informatique, Automatique, Électronique - Électrotechnique, Mathématiques de Lorraine, 2021. English. ⟨NNT : 2021LORR0199⟩ (2021)
BASE
Show details
13
MIC ...
Kurthy, Miklos. - : Open Science Framework, 2021
BASE
Show details
14
Advances in formal Slavic linguistics 2018 ...
Unkn Unknown. - : Freie Universität Berlin, 2021
BASE
Show details
15
Cyclic scope and processing difficulty in a Minimalist parser
In: Glossa: a journal of general linguistics; Vol 6, No 1 (2021); 8 ; 2397-1835 (2021)
BASE
Show details
16
Revisiting subjunctive obviation in French: a formal acceptability judgment study
In: Glossa: a journal of general linguistics; Vol 6, No 1 (2021); 59 ; 2397-1835 (2021)
BASE
Show details
17
Approximation derived from a scalar exclusive particle associating with covert focus: The case of Hebrew be-sax ha-kol
In: Glossa: a journal of general linguistics; Vol 6, No 1 (2021); 5 ; 2397-1835 (2021)
BASE
Show details
18
Ideal Words: A Vector-Based Formalisation of Semantic Competence ...
Herbelot, A; Copestake, Ann. - : Apollo - University of Cambridge Repository, 2021
BASE
Show details
19
現代中国語の限定語の意味指示と論理分析 ; A Logical Analysis of the Semantic Orientation of Attributives in Mandarin Chinese
劉 燕嵐; リュウ エンラン. - : 神奈川大学人文学会, 2021. : The Society of Humanities at Kanagawa University, 2021
BASE
Show details
20
Translation of CCS into CSP, Correct up to Strong Bisimulation ; Springer LNCS ; Software Engineering and Formal Methods (SEFM 21)
BASE
Show details

Page: 1 2 3 4 5...195

Catalogues
535
53
434
0
0
9
9
Bibliographies
3.454
1
0
0
0
0
0
0
1
Linked Open Data catalogues
0
Online resources
6
0
1
0
Open access documents
257
30
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern