The complexity of bounded quantifiers in some ordered abelian groups

DOI10.1305/NDJFL/1193667710zbMATH Open1137.03021OpenAlexW2032968544MaRDI QIDQ2425354FDOQ2425354

Philip Scowcroft

Publication date: 29 April 2008

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1193667710

zbMATH Keywords

ordered abelian groupelimination of unbounded quantifiers

Mathematics Subject Classification ID

Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Model theory of ordered structures; o-minimality (03C64)

Cited In (1)

• Title not available (Why is that?)

   Recommendations

• Elimination of unbounded quantifiers for some poly-regular groups of infinite rank 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: The complexity of bounded quantifiers in some ordered abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425354)