"Computability of Algebraic and Definable Closure."

Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel (2020)

> Home

Details and statistics

DOI: 10.1007/978-3-030-36755-8_1

access: closed

type: Conference or Workshop Paper

metadata version: 2019-12-16

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lfcs/AckermanFP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lfcs/AckermanFP20
Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel:
Computability of Algebraic and Definable Closure. LFCS 2020: 1-11

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.