uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Undecidability of finite satisfiability and characterization of NP in finite model theory
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Mathematics, Algebra and Geometry.
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Place, publisher, year, edition, pages
2015. , 30 p.
Series
U.U.D.M. project report, 2015:16
National Category
Algebra and Logic
Identifiers
URN: urn:nbn:se:uu:diva-254570OAI: oai:DiVA.org:uu-254570DiVA: diva2:818862
Educational program
Bachelor Programme in Mathematics
Supervisors
Examiners
Available from: 2015-06-09 Created: 2015-06-09 Last updated: 2015-06-09Bibliographically approved

Open Access in DiVA

fulltext(510 kB)247 downloads
File information
File name FULLTEXT01.pdfFile size 510 kBChecksum SHA-512
282f6de1289edc8eb3c6f7e132b0fb853192008e381614b67db82aba8f9d51398d288436c281e10c304138081d3d66f0f622b4a0b56c5864a663061d9e138d37
Type fulltextMimetype application/pdf

By organisation
Algebra and Geometry
Algebra and Logic

Search outside of DiVA

GoogleGoogle Scholar
Total: 247 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 823 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf