
ALT In this paper, we establish necessary and sufficient conditions under which six closure- or interior-based operations on bounded trellises are uninorms. These operations incorporate triangular norms, triangular conorms, or both, and form three order-dual pairs. Since the underlying pseudo-order need not be transitive and meet and join need not be associative, standard lattice arguments do not apply directly. Under a fixed ambient transitivity assumption, the first pair is characterized by image, monotonicity, and compatibility conditions for the associated maps on elements incomparable with the neutral element; an additional comparison condition used in earlier sufficient constructions is shown to be redundant. Complete characterizations are also obtained for the variants with an absorbing endpoint, including both nondegenerate and degenerate interval cases. For the pair involving both a triangular norm and a triangular conorm, we derive exact comparison conditions requiring the triang

ALT We define a wide class of tree forcings that we call normed-tree forcings and prove that they can preserve Ramsey ultrafilters. These include fat-tree forcings as particular cases. As an application, we prove the consistency with ZFC of π‘=π²=β΅β < minLc=π =β΅β, where π‘ denotes the dominating number, π² the ultrafilter number, and minLc the minimum localization cardinal. This solves some open questions about pairs of classical cardinal characteristics, such as the consistency of both π’_ubd and its dual strictly larger than π².

ALT Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigmaβ. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some DeltaβX set is not X-c.e.

ALT We construct an invariant symmetric ternary relation with existence and stationarity over models for classes of characteristic-zero Frobenius fields associated with Melnikov formations. For proper formations, the automorphism theories of their canonical root-predicate expansions have amalgamation and no model companion. The underlying fields are then unbounded, and their theories are NSOPβ but not simple. In this case, on triples of elementary submodels, the constructed relation implies ordinary nonforking, which implies Kim-independence, which implies linear disjointness; all three implications are strict. We also study p.e.c. fields with group actions, namely fields existentially closed in every regular extension carrying an extension of the action. We prove that the class of p.e.c. difference fields of characteristic zero is not elementary, and that the theory of all characteristic-zero difference fields with canonical root predicates has no model companion.

ALT We conjecture that for each integer ββ₯ 2, the equivalence relation arising from the shift action of ββ on 2Ο^β½β) is hypersmooth. We prove this conjecture for β=2, reduce the general case to a problem in Borel graph colorings, and establish the general case in measure. We also show that under certain mild hypotheses on a hypersmooth equivalence relation E, every finite-index Borel super-equivalence relation of E is hypersmooth.
![We present a hypersequent calculus H_R for cyclic involutive residuated lattices and prove strong standard completeness for arbitrary theories in a fixed countable propositional language. Standard models are chains on [0,1]; neither commutativity nor equality of the monoid unit and the dualizing constant is assumed. The chain semantics is the class K_R defined by unit cyclicity and all ordered finite-history conditions. Every countable member of K_R embeds into a standard chain preserving the entire signature. The construction combines central-support reconstruction, gap insertion and relative contraction. A relative comparison construction supplies the required chain countermodels. We also prove admissibility of the unrestricted density rule for theoremhood and effective elimination from finite proofs without additional assumption leaves. Elimination uses terminating enumeration of density-free proofs; ordinary Cut is retained, and no complexity bound is claimed. Further constructions](https://pbs.twimg.com/media/HXWMKaaWIAA1gJI.png?name=small&format=webp)
ALT We present a hypersequent calculus H_R for cyclic involutive residuated lattices and prove strong standard completeness for arbitrary theories in a fixed countable propositional language. Standard models are chains on [0,1]; neither commutativity nor equality of the monoid unit and the dualizing constant is assumed. The chain semantics is the class K_R defined by unit cyclicity and all ordered finite-history conditions. Every countable member of K_R embeds into a standard chain preserving the entire signature. The construction combines central-support reconstruction, gap insertion and relative contraction. A relative comparison construction supplies the required chain countermodels. We also prove admissibility of the unrestricted density rule for theoremhood and effective elimination from finite proofs without additional assumption leaves. Elimination uses terminating enumeration of density-free proofs; ordinary Cut is retained, and no complexity bound is claimed. Further constructions




