SearcharxivSearch

arXiv subjects

Daniel Quigley

Publications and source records attributed to Daniel Quigley.

7 recordsLinked to original sources

Mean tropical year length at arbitrary ecliptic longitude

We compute the mean interval between successive returns of the apparent geocentric solar longitude $\lambda$ to a fixed value $L \in \{0^\circ, 45^\circ, 90^\circ, \ldots, 315^\circ\}$, averaged over a multi-millennium window; this gives eight ``mean years'' against which calendar leap rules can be tuned: four cardinal-point years (equinoxes and solstices); four cross-quarter years. The construction is built on Meeus's low-precision solar theory (Astronomical Algorithms, 2nd ed., 1998), itself a low-order truncation of Newcomb's Tables of the Sun re-expanded around J2000.0. Where Meeus presents polynomial coefficients without justification, we draw on Smart's Textbook on Spherical Astronomy (6th ed., revised by Green, 1977) for the underlying derivations. Numerical accuracy is validated against the cardinal-point intervals tabulated in Meeus, More Mathematical Morsels, 2002. We close with a derivation of the secular drift equation, showing that, regardless of how well a leap rule is tuned, the slow shrinkage of the tropical year produces a quadratic cumulative error that reaches one day in $\sim$5{,}700 years for any fixed intercalation rule.

astro-ph.EP

Formal specification and behavioral simulation of the holiday gift exchange game

The holiday gift exchange game is a familiar social institution with nontrivial strategic structure. We provide a formal treatment of the game's mechanics, defining the state space, action sets, and the recursive structure of stealing chains; we prove termination and derive an algorithm for counting distinct game trajectories, which grow far faster than the space of possible final allocations. Beyond the base mechanics, we introduce a decorated model incorporating partial information, social costs, and adaptive strategies grounded in discrete choice theory and the frustration-aggression literature. A full factorial simulation of 240,000 games yields three findings of note: implicit social costs are the dominant regulator of aggression, reducing stealing by 27--48\% and outweighing both uncertainty and strategic sophistication; partial information, contrary to expectation, slightly increases stealing through asymmetric uncertainty; correlated valuations amplify every behavioral effect, so that consensus about gift quality, rather than the features themselves, is what intensifies competition. The first-player advantage is robust across all conditions.

cs.GT

A vector logic for intensional formal semantics

Formal semantics and distributional semantics are distinct approaches to linguistic meaning: the former models meaning as reference via model-theoretic structures; the latter represents meaning as vectors in high-dimensional spaces shaped by usage. This paper proves that these frameworks are structurally compatible for intensional semantics. We establish that Kripke-style intensional models embed injectively into vector spaces, with semantic functions lifting to (multi)linear maps that preserve composition. The construction accommodates multiple index sorts (worlds, times, locations) via a compound index space, representing intensions as linear operators. Modal operators are derived algebraically: accessibility relations become linear operators, and modal conditions reduce to threshold checks on accumulated values. For uncountable index domains, we develop a measure-theoretic generalization in which necessity becomes truth almost everywhere and possibility becomes truth on a set of positive measure, a non-classical logic natural for continuous parameters.

math.LO

On measuring grounding and generalizing grounding problems

The symbol grounding problem asks how tokens like cat can be about cats, as opposed to mere shapes manipulated in a calculus. We recast grounding from a binary judgment into an audit across desiderata, each indexed by an evaluation tuple (context, meaning type, threat model, reference distribution): authenticity (mechanisms reside inside the agent and, for strong claims, were acquired through learning or evolution); preservation (atomic meanings remain intact); faithfulness, both correlational (realized meanings match intended ones) and etiological (internal mechanisms causally contribute to success); robustness (graceful degradation under declared perturbations); compositionality (the whole is built systematically from the parts). We apply this framework to four grounding modes (symbolic; referential; vectorial; relational) and three case studies: model-theoretic semantics achieves exact composition but lacks etiological warrant; large language models show correlational fit and local robustness for linguistic tasks, yet lack selection-for-success on world tasks without grounded interaction; human language meets the desiderata under strong authenticity through evolutionary and developmental acquisition. By operationalizing a philosophical inquiry about representation, we equip philosophers of science, computer scientists, linguists, and mathematicians with a common language and technical framework for systematic investigation of grounding and meaning.

cs.AI

Divide and Confer: Aggregating Information without Verification

We examine receiver-optimal mechanisms for aggregating information divided across many biased senders. Each sender privately observes an unconditionally independent signal about an unknown state, so no sender can verify another's report. A receiver makes a binary accept/reject decision that determines the players' payoffs via the state. When information is divided across a small population, and bias is low, the receiver-optimal mechanism coincides with the sender-preferred allocation, and can be implemented by letting senders confer privately before reporting. However, for larger populations, the receiver can benefit from the informational divide. We introduce a novel incentive-compatibility-in-the-large approach to solve the high-dimensional mechanism design problem for the large-population limit. Using this, we show that optimal mechanisms converge to one that depends only on the accept payoff and punishes excessive consensus in the direction of the common bias. These surplus burning punishments lead to payoffs that are bounded away from the first-best.

econ.TH

A vector logic for extensional formal semantics

This paper proves a homomorphism between extensional formal semantics and distributional vector space semantics, demonstrating structural compatibility. Formal semantics models meaning as reference, using logical structures to map linguistic expressions to truth conditions, while distributional semantics represents meaning through word vectors derived from contextual usage. By constructing injective mappings that preserve semantic relationships, we show that every semantic function in an extensional model corresponds to a compatible vector space operation. This result respects compositionality and extends to function compositions, constant interpretations, and $n$-ary relations. Rather than pursuing unification, we highlight a mathematical foundation for hybrid cognitive models that integrate symbolic and sub-symbolic reasoning and semantics. These findings support multimodal language processing, aligning `meaning as reference' (Frege, Tarski) with `meaning as use' (Wittgenstein, Firth).

math.LO

Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics

Intensional computation derives concrete outputs from abstract function definitions; extensional computation defines functions through explicit input-output pairs. In formal semantics: intensional computation interprets expressions as context-dependent functions; extensional computation evaluates expressions based on their denotations in an otherwise fixed context. This paper reformulates typed extensional and intensional models of formal semantics within a category-theoretic framework and demonstrates their natural representation therein. We construct $\textbf{ModInt}$, the category of intensional models, building on the categories $\textbf{Set}$ of sets, $\textbf{Rel}$ of relations, and $\textbf{Kr}$ and $\textbf{Kr}_\textbf{b}$ of Kripke frames with monotone maps and bounded morphisms, respectively. We prove that trivial intensional models are equivalent to extensional models, providing a unified categorical representation of intensionality and extensionality in formal semantics. This approach reinterprets the relationship between intensions and extensions in a categorical framework and offers a modular, order-independent method for processing intensions and recovering extensions; contextualizing the relationship between content and reference in category-theoretic terms. We discuss implications for natural language semantics and propose future directions for contextual integration and exploring $\textbf{ModInt}$'s algebraic properties.

math.CT