The complexity of definability by open first-order formulas

  • Main
  • 2020 / 05
  • The complexity of definability by open first-order formulas
Logic Journal of IGPL 2020 / 05

The complexity of definability by open first-order formulas

Areces, Carlos, Campercholi, Miguel, Penazzi, Daniel, Ventura, Pablo
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Journal:
Logic Journal of the IGPL
DOI:
10.1093/jigpal/jzaa008
Date:
May, 2020
File:
PDF, 189 KB
2020
Conversion to is in progress
Conversion to is failed