INTERLEAVING LOGIC AND COUNTING
From MaRDI portal
Publication:6199174
DOI10.1017/bsl.2023.30MaRDI QIDQ6199174
Thomas F. III Icard, J. F. A. K. van Benthem
Publication date: 23 February 2024
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Modal logic (including the logic of norms) (03B45) Philosophical and critical aspects of logic and foundations (03A05) Logic of natural languages (03B65) Logic in computer science (03B70)
Cites Work
- Quantifiers and cognition: logical and computational perspectives
- On the expressive power of counting
- An analysis of first-order logics of probability
- On regularity of context-free languages
- Axiomatizing the logic of comparative probability
- Numerical abstraction via the Frege quantifier
- Growing commas. A study of sequentiality and concatenation
- Harvey Friedman's research on the foundations of mathematics
- Essays in logical semantics
- Complexity results for classes of quantificational formulas
- Language in action. Categories, lambdas and dynamic logic
- An optimal lower bound on the number of variables for graph identification
- Qualitative probability as an intensional logic
- A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
- Undecidability results on two-variable logics
- Generalized quantifiers and modal logic
- Multi-dimensional modal logic
- Program constructions that are safe for bisimulation
- Inferring probability comparisons
- Undecidability without arithmetization
- A logic for reasoning about probabilities
- Model theory of monadic predicate logic with the infinity quantifier
- Commutative regular languages -- properties and state complexity
- On the expressive power of description logics with cardinality constraints on finite and infinite sets
- A simple logic of functional dependence
- Semigroups, Presburger formulas, and languages
- In so many possible worlds
- Rational sets in commutative monoids
- Guards, bounds, and generalized semantics
- Complexity of the two-variable fragment with counting quantifiers
- Complexity of modal logics with Presburger constraints
- Undecidable theories
- Solvable cases of the decision problem
- Majority Digraphs
- QUALITATIVE MODALITIES
- A Simple Proof of a Theorem of Erdös and Szekeres*
- The first order properties of products of algebraic systems
- Syllogistic Logic with Cardinality Comparisons
- Recurring Dominoes: Making the Highly Undecidable Highly Understandable
- Logical constants in quantifier languages
- Generalized quantifiers and natural language
- The Härtig quantifier: a survey
- Bounds on Positive Integral Solutions of Linear Diophantine Equations
- Propositional quantifiers in modal logic1
- On languages with two variables
- The Diophantine Problem for Addition and Divisibility
- The relative efficiency of propositional proof systems
- Computational Semantics for Monadic Quantifiers
- Proof Complexity
- Reducibility among Combinatorial Problems
- THE MODAL LOGIC OF STEPWISE REMOVAL
- Modal Logics with Composition on Finite Forests
- SYLLOGISTIC LOGIC WITH CARDINALITY COMPARISONS, ON INFINITE SETS
- Arithmetic, first-order logic, and counting quantifiers
- Syllogistic logic with “Most”
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- On Context-Free Languages
- Intuitive Probability on Finite Sets
- Trial and error predicates and the solution to a problem of Mostowski
- Definability and decision problems in arithmetic
- Concatenation as a basis for arithmetic
- THE LOGIC OF COMPARATIVE CARDINALITY
- String theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: INTERLEAVING LOGIC AND COUNTING
