Related papers: Permutation Models of Second Order

The fine-tuning of deep pre-trained models has revealed compositional properties, with multiple specialized modules that can be arbitrarily composed into a single, multi-task model. However, identifying the conditions that promote…

The first order post Newtonian scheme in multiple systems presented by Damour-Soffel-Xu is extended to the second order one for light propagation without changing the advantage of the scheme on the linear partial differential equations of…

The perturbation theory expansion presented earlier to describe the phase-ordering kinetics in the case of a nonconserved scalar order parameter is generalized to the case of the $n$-vector model. At lowest order in this expansion, as in…

We construct representations of the Heisenberg algebra by pushing the perturbation expansion to high orders. If the multiplication operators $B_{1,2}$ tend to differential operators of order $l_{2,1}$, respectively, the singularity is…

The characterization of PSPACE-queries over ordered structures as exactly those expressible in first-order logic with partial fixpoints (Vardi'82) is one of the classical results in the field of descriptive complexity. In this paper, we…

When primed with only a handful of training samples, very large, pretrained language models such as GPT-3 have shown competitive results when compared to fully-supervised, fine-tuned, large, pretrained language models. We demonstrate that…

This work aims to predict channels in wireless communication systems based on noisy observations, utilizing sequence-to-sequence models with attention (Seq2Seq-attn) and transformer models. Both models are adapted from natural language…

This paper discusses the method of formative rules for first-order term rewriting, which was previously defined for a higher-order setting. Dual to the well-known usable rules, formative rules allow dropping some of the term constraints…

First-Order Logic (FOL) is widely regarded as one of the most important foundations for knowledge representation. Nevertheless, in this paper, we argue that FOL has several critical issues for this purpose. Instead, we propose an…

In these notes we present the method introduced by Neeman of generalized side conditions with two types of models. We then discuss some applications: the Friedman-Mitchell poset for adding a club in \omega_2 with finite conditions,…

Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…

Revised to reflect the differences between the second order perturbation theory method developed by Scheitzer and Czycholl, and followed by us, and the iterated perturbation theory (IPT)of Georges and Kotliar, et al. Because of our domain…

In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

Inspired by the works in [1] and [8] we introduce what we call $k$-th-order fluctuation fields and study their scaling limits. This construction is done in the context of particle systems with the property of orthogonal self-duality. This…

The goal of this article and its precursor is to demonstrate, by example, the existence of "transfer operators" betweeen relative trace formulas, which generalize the scalar transfer factors of endoscopy. These transfer operators have all…

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of…

The preferential conditional logic PCL, introduced by Burgess, and its extensions are studied. First, a natural semantics based on neighbourhood models, which generalise Lewis' sphere models for counterfactual logics, is proposed. Soundness…

We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…