Title	Monotone theories
Creator	Moconja, Slavko
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-10-15T15:41
Description	By a result of Simon it is known that a theory of a coloured linear order has quantifier elimination after naming all unary $L$-definable sets and all $L$-definable binary monotone relations. Motivated by this result we define the notion of monotone theories, theories of linear orders in which binary definable sets have previous description. More precisely, an $\aleph_0$-saturated structure $M$ is said to be monotone if there exists an $L$-definable linear order $
Extent	26.0
Subject	Mathematics; Mathematical logic and foundations; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Wroclaw
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2019-04-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0378204
URI	http://hdl.handle.net/2429/69677
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos