Enumeration reducibility in closure spaces with applications to logic and algebra - Archive ouverte HAL Access content directly
Conference Papers Year :

Enumeration reducibility in closure spaces with applications to logic and algebra

(1)
1
Emmanuel Jeandel
Theoretical adverse computations, and safety
CV

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Logic in Computer Science [cs.LO]

Emmanuel Jeandel  : Connect in order to contact the contributor

https://hal.inria.fr/hal-01652505

Submitted on : Thursday, November 30, 2017-1:19:34 PM

Last modification on : Saturday, June 25, 2022-7:41:03 PM

Not file

Dates and versions

hal-01652505 , version 1 (30-11-2017)

Identifiers

  • HAL Id : hal-01652505 , version 1

Cite

Emmanuel Jeandel. Enumeration reducibility in closure spaces with applications to logic and algebra. Logic in Computer Science (LICS), 2017, reyjkavik, Iceland. ⟨hal-01652505⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

CNRS INRIA UNIV-LORRAINE INRIA2 TDS-MACS LORIA LORIA-FM
59 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More