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...

Full description

Bibliographic Details

Published in:	Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 1 - 13
Main Author:	Verbrugge, Rineke
Format:	Conference Proceeding
Language:	English
Published:	IEEE 29.06.2021
Subjects:	Complexity theory Computational modeling Computer science Finite element analysis
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!