Non-definability results for randomised first-order logic

DOI10.4230/LIPICS.CSL.2011.218zbMATH Open1247.68103OpenAlexW2296041599MaRDI QIDQ2915684FDOQ2915684

Authors: Kord Eickmeyer 

Publication date: 18 September 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4735.html

Recommendations

• Randomisation and derandomisation in descriptive complexity theory
• Randomisation and derandomisation in descriptive complexity theory
• scientific article; zbMATH DE number 2101962
• On the Complexity of the First-order Random Theory
• Zero-one law and definability of linear order

zbMATH Keywords

descriptive complexityderandomisationrandomised logics

Mathematics Subject Classification ID

Descriptive complexity and finite models (68Q19)

Cited In (4)

• Title not available (Why is that?)
• Non-definability of Languages by Generalized First-order Formulas over (N,+)
• Randomisation and derandomisation in descriptive complexity theory
• Randomisation and derandomisation in descriptive complexity theory

This page was built for publication: Non-definability results for randomised first-order logic

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