Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
type: Item
instance of: scholarly article
zbMATH Open document ID: 1434.03019
author: Yijia Chen
author: Jörg Flum
author: Xuangui Huang
publication date: 2020-05-26T00:00:00Z
full work available at URL: https://arxiv.org/abs/1704.03167
Mathematics Subject Classification ID: 03B10
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 7204311
zbMATH Keywords: first-order logic
zbMATH Keywords: quantifier rank
zbMATH Keywords: parameterized \(\mathrm{AC}^0\)
zbMATH Keywords: circuit depth
MaRDI profile type: Publication
arXiv ID: 1704.03167
OpenAlex ID: W2964221993
title: Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
DOI: 10.4230/LIPICS.CSL.2017.19
Recommended article: The structure of slices over minimal logic
Recommended article: Strong computability of slices over the logic GL
Recommended article: First-order concatenation theory with bounded quantifiers
Recommended article: A binary quantifier for definite descriptions for cut free free logics
Recommended article: Definability hierarchies of generalized quantifiers
Recommended article: Quantified propositional calculi and fragments of bounded arithmetic
Recommended article: First-order definability on finite structures
Recommended article: Slices and levels of extensions of the minimal logic
Recommended article: Q3778732
Recommended article: Q4525283
description: scientific article; zbMATH DE number 7204311