I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Bouncing Threads for Circular and Non-Wellfounded Proofs ..:
, In:
Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
,
Baelde, David
;
Doumane, Amina
;
Kuperberg, Denis
. - p. 1-13 , 2022
Link:
https://dl.acm.org/doi/10.1145/3531130.3533375
RT T1 <cTitle>Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science</cTitle>: T1 <Title>Bouncing Threads for Circular and Non-Wellfounded Proofs : Towards Compositionality with Circular Proofs</Title> UL https://suche.suub.uni-bremen.de/peid=acm-3533375&Exemplar=1&LAN=DE A1 Baelde, David A1 Doumane, Amina A1 Kuperberg, Denis A1 Saurin, Alexis PB ACM YR 2022 K1 Circular Proofs K1 Coinduction K1 Curry-Howard K1 Cut Elimination K1 Decidability K1 Fixed Points K1 Linear Logic. K1 Theory of computation K1 Logic K1 Models of computation K1 Computability K1 Proof theory K1 Computing methodologies K1 Symbolic and algebraic manipulation K1 Symbolic and algebraic algorithms K1 Theorem proving algorithms SP 1 OP 13 LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3531130.3533375 DO https://dl.acm.org/doi/10.1145/3531130.3533375 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)
