Zero-one laws for provability logic: Axiomatizing validity in almost all models and almost all frames

It has been shown in the late 1960s that each formula of first-order logic without constants and function symbols obeys a zero-one law: As the number of elements of finite models increases, every formula holds either in almost all or in almost no models of that size. Therefore, many properties of mo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science S. 1 - 13
1. Verfasser:	Verbrugge, Rineke
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 29.06.2021
Schlagworte:	Complexity theory Computational modeling Computer science Finite element analysis
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!