DE eng

Search in the Catalogues and Directories

Hits 1 – 6 of 6

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
Multiplicative Linear Logic from Logic Programs and Tilings
In: https://hal.archives-ouvertes.fr/hal-02895111 ; 2021 (2021)
BASE
Show details
3
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
4
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
BASE
Show details
5
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
6
Stellar Resolution: Multiplicatives - for the linear logician, through examples
In: https://hal.archives-ouvertes.fr/hal-02977750 ; 2021 (2021)
Abstract: The stellar resolution is an asynchronous model of computation used in Girard's Transcendental Syntax which is based on Robinson's first-order clausal resolution. By using methods of realisability for linear logic, we obtain a new model of multiplicative linear logic (MLL) based on sort of logic programs called constellations which are used to represent proofs, cut-elimination, formulas/types, correctness and provability very naturally. A philosophical justification of these works coming from the Kantian inspirations of Girard would be to study the conditions of possibility of logic, that is the conditions from which logical constructions emerge.
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; Semantics
URL: https://hal.archives-ouvertes.fr/hal-02977750v4/file/main.pdf
https://hal.archives-ouvertes.fr/hal-02977750v4/document
https://hal.archives-ouvertes.fr/hal-02977750
BASE
Hide details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
6
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern