INTERLEAVING LOGIC AND COUNTING

DOI10.1017/BSL.2023.30MaRDI QIDQ6199174zbMATH OpenFDO

Authors Johan van Benthem, Thomas F. III Icard

Publication date 23 February 2024

Published in The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/BSL.2023.30

zbMATH Keywords

arithmeticcardinalitycountinglogicqualitativequantitative

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Modal logic (including the logic of norms) (03B45) Logic of natural languages (03B65) Logic in computer science (03B70)

Cites work

• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• A logic for reasoning about probabilities
• A monotonicity calculus and its completeness
• A simple logic of functional dependence
• A Simple Proof of a Theorem of Erdös and Szekeres^*
• An analysis of first-order logics of probability
• An optimal lower bound on the number of variables for graph identification
• Arithmetic, first-order logic, and counting quantifiers
• Axiomatizing the logic of comparative probability
• Bounds on Positive Integral Solutions of Linear Diophantine Equations
• Commutative regular languages -- properties and state complexity
• Complexity of modal logics with Presburger constraints
• Complexity of the two-variable fragment with counting quantifiers
• Complexity results for classes of quantificational formulas
• Computational Semantics for Monadic Quantifiers
• Concatenation as a basis for arithmetic
• Definability and decision problems in arithmetic
• Essays in logical semantics
• First-order logic with counting: at least, \textit{weak} Hanf normal forms always exist and can be computed!
• Generalized quantifiers and modal logic
• Generalized quantifiers and natural language
• Growing commas. A study of sequentiality and concatenation
• Guards, bounds, and generalized semantics
• Harvey Friedman's research on the foundations of mathematics
• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 3941493 (Why is no real title available?)
• scientific article; zbMATH DE number 3593524 (Why is no real title available?)
• scientific article; zbMATH DE number 1234104 (Why is no real title available?)
• scientific article; zbMATH DE number 1310971 (Why is no real title available?)
• scientific article; zbMATH DE number 979011 (Why is no real title available?)
• scientific article; zbMATH DE number 1047511 (Why is no real title available?)
• scientific article; zbMATH DE number 1764654 (Why is no real title available?)
• scientific article; zbMATH DE number 3266609 (Why is no real title available?)
• scientific article; zbMATH DE number 3310894 (Why is no real title available?)
• scientific article; zbMATH DE number 3366923 (Why is no real title available?)
• scientific article; zbMATH DE number 3029480 (Why is no real title available?)
• In so many possible worlds
• Inferring probability comparisons
• Intuitive Probability on Finite Sets
• Language in action. Categories, lambdas and dynamic logic
• Logical constants in quantifier languages
• Majority digraphs
• Modal logic
• Modal logics with composition on finite forests: expressivity and complexity
• Model theory of monadic predicate logic with the infinity quantifier
• Multi-dimensional modal logic
• Numerical abstraction via the Frege quantifier
• On Context-Free Languages
• On languages with two variables
• On regularity of context-free languages
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
• On the expressive power of counting
• On the expressive power of description logics with cardinality constraints on finite and infinite sets
• Program constructions that are safe for bisimulation
• Proof Complexity
• Propositional quantifiers in modal logic1
• Qualitative modalities
• Qualitative probability as an intensional logic
• Quantifiers and cognition: logical and computational perspectives
• Rational sets in commutative monoids
• Recurring Dominoes: Making the Highly Undecidable Highly Understandable
• Reducibility among combinatorial problems
• Semigroups, Presburger formulas, and languages
• Solvable cases of the decision problem
• String theory
• Syllogistic logic with ``most
• Syllogistic logic with cardinality comparisons
• Syllogistic logic with cardinality comparisons, on infinite sets
• The Diophantine Problem for Addition and Divisibility
• The first order properties of products of algebraic systems
• The Härtig quantifier: a survey
• The logic of comparative cardinality
• THE MODAL LOGIC OF STEPWISE REMOVAL
• The relative efficiency of propositional proof systems
• Trial and error predicates and the solution to a problem of Mostowski
• Undecidability results on two-variable logics
• Undecidability without arithmetization
• Undecidable theories

Cited in

(5)

• An investigation of the negationless fragment of the Rescher-Härtig quantifier
• The modal logic of n-state frames
• Axiomatization of modal logic with counting
• Game semantics for modal logic with counting
• Modal logic with ``Most

This page was built for publication: INTERLEAVING LOGIC AND COUNTING

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199174)