Interleaving Logic and Counting

2025-07-07

AI Summary

This study addresses the deep coupling between logical reasoning and arithmetic capabilities—such as counting and numerical comparison—in natural language quantification. We propose a unified logical framework integrating counting operators into first- and second-order logic, yielding an axiomatizable normal form that systematically characterizes quantificational phenomena including numerical syllogisms and cardinality comparisons. Leveraging Presburger arithmetic, Diophantine modeling, and modal extensions, we delineate definability boundaries over finite and infinite models; achieve full characterization within the single-predicate fragment; and establish decidability thresholds for multiple logical fragments. Crucially, we construct a bidirectional theoretical bridge between logic and arithmetic, extending formal semantic analysis to empirically grounded cognitive foundations. This advances precise, cognitively plausible modeling of natural language quantification structures.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Cognitive Modeling & Cognitive Systems: Conceptual Inference and Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

Application Category

• Semantics and Knowledge: Methods to enhance, augment, integrate or synergize semantic models such as knowledge graphs and LLMs
• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Search and Retrieval-Augmented AI: Web learning to rank, online learning, and counterfactual learning for ranking

Abstract

Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus "grassroots mathematics". We begin with a brief review of first-order logic with counting operators and cardinality comparisons. This system is known to be of high complexity, and drowns out finer aspects of the combination of logic and counting. We move to a small fragment that can represent numerical syllogisms and basic reasoning about comparative size: monadic first-order logic with counting. We provide normal forms that allow for axiomatization, determine which arithmetical notions can be defined on finite and on infinite models, and conversely, we discuss which logical notions can be defined out of purely arithmetical ones, and what sort of (non-)classical logics can be induced. Next, we investigate a series of strengthenings, again using normal form methods. The monadic second-order version is close, in a precise sense, to additive Presburger Arithmetic, while versions with the natural device of tuple counting take us to Diophantine equations, making the logic undecidable. We also define a system that combines basic modal logic over binary accessibility relations with counting, needed to formulate ubiquitous reasoning patterns such as the Pigeonhole Principle. We return to our starting point in natural language, confronting the architecture of our formal systems with linguistic quantifier vocabulary and syntax. We conclude with some general thoughts on yet further entanglements of logic and counting in formal systems, on rethinking the qualitative/quantitative divide, and on connecting our analysis to empirical findings in cognitive science.

Problem

• Combining logical and arithmetical features in natural language quantifiers
• Analyzing monadic first-order logic with counting for numerical syllogisms
• Exploring formal systems linking logic and counting in linguistic contexts

Innovation

• Monadic first-order logic with counting operators
• Normal forms for axiomatization and definability
• Combining modal logic with counting mechanisms