June 20, 2017 preprint Open access First-order logic with counting: at least, weak hanf normal forms always exist and can be computed! arXiv (Cornell University) DOI: 10.5555/3329995.3330068 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 1 stored of 1 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Counting Bounded Tree Depth Homomorphisms 2020 Proceedings - Symposium on Logic in Computer Science conference-paper Computer Science Advanced Graph Theory Research Open access 21 citations 1 result References 0