
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

ALT The axiom V = HOD, referring to the class of hereditarily ordinal-definable sets, is contingently contingent by forcingโit holds contingently in the generic multiverse of some models of set theory but not others. Thus we introduce and investigate the contingent HOD dichotomy, according to which either (1) the set-theoretic universe V is close to HOD by forcingโHOD is a ground, V = HOD is forceable, the universe is ordinal-definable from a set parameter V=HODb, the blurry HOD hierarchy collapses to kappa-HOD for some cardinal kappa, and furthermore these features are invariant by forcing and hold throughout the generic multiverse; or (2) the universe V is far from HOD by forcing in all those respects, so Vโ HOD, but also HOD is not a ground, V = HOD is not forceable, the set-theoretic universe is not ordinal-definable from a set, the universe is not kappa-HOD for any kappa, and these features hold invariantly throughout the generic multiverse. We investigate the nature of the dichotomy i

ALT Recent theories that take determinateness as primitive are either nonclassical theories of nonclassical truth, like Field's INT, or classical theories of classical truth, like Fujimoto and Halbach's CD and CD^+. This paper develops a third option: a classical theory of nonclassical truth. The theory, KFDcs, extends the Kripke-Feferman theory KFcs with a primitive determinateness predicate. Unlike CD^+, KFDcs keeps the iteration of truth unrestricted and gives up its completeness. With or without a consistency axiom, KFD is proof-theoretically equivalent to the theory IDฬโ of twice iterated fixed points, with ordinal ฯ(ฯ(ฮตโ, 0)0), thus stronger than CD^+. It is also shown that replacing full induction with internal induction yields ordinal ฯ(ฯ(ฯ, 0)0), and restricting internal induction to total formulae yields ฯ(ฮตโ,0), the ordinal of KF.

ALT We prove Chang-style omitting types theorems for standard first-order Lukasiewicz logic. Starting from a prescribed model M, we obtain an extension that omits higher-complexity types while preserving lower-level types already realized in M. If T is a ฮ โโโ-theory, every model of T has an exact extension that preserves its realized ฮฃโโโ-types and omits every ฮฃโโโ-type not generated by a ฮฃโโโ-type. An iterated construction also omits infinity-universal types, whose unbounded quantifier complexity cannot eventually be generated by the corresponding lower-complexity fragments of a single type. The main tool is a refinement of Robinson's infinite forcing sensitive to the quantifier complexity of formulas.

ALT We study distributive lattices with an ideal-valued generalized implication satisfying a commutativity identity. This class extends commutative weak Heyting algebras by allowing implication values to be non-principal ideals. We characterize its intersection with several known classes of gi-lattices, study gi-deductive systems and their relationship with gi-filters and gi-congruences, and extend the relational characterization of commutativity to this setting. The resulting correspondence yields a Priestley-style duality by restricting the established duality for gi-lattices.

ALT This paper investigates a relational semantics for onto-epistemic logic with two semi-negations. The frames carry two pairs of quasi-orders and two commuting involutions. Some frames have nondistributive lattices of stable sets. The four- and nine-valued entailments are recovered as joint entailment on two particular finite frames. Sound and complete binary consequence calculi are given for both component entailments and for joint entailment. The joint Lindenbaum algebra embeds subdirectly into the product of its two component quotients. This embedding shows that joint derivability is the intersection of the two component derivability relations. The finite model property is proved using Dedekind-MacNeille completion and a filter-ideal representation of the resulting lattice. All three entailments are decidable by interleaving the search for a derivation with the search for a finite countermodel.

ALT We study self-interpretations of theories and their connection to Krajรญฤek-theories. Our two main results are the following. Firstly, if the self-interpretations of a theory form a group in the category INTโ of theories and interpretations, then the theory is a Krajรญฤek-theory. Secondly, a sequential theory is a Krajรญฤek-theory iff all its self-interpretations are initial. Here initiality of the interpretation K means roughly that its internal interpretations of the weak theory Sยนโ are initial in all interpretations of Sยนโ.

ALT Kolmogorov interpreted intuitionistic logic as a calculus of problems and later remarked that a complete treatment should deal with problems and propositions together. Melikhov's logic HC is such a joint two-sorted system: it combines classical propositions with intuitionistic problems by means of two modalities, the problem!A (โfind a proof of the proposition Aโ) and the proposition phi (โthe problem phi has a solutionโ). We give the language of HC a formal semantics in which the modalities are read literally: solutions of!A are proofs of A in a fixed formal theory,?phi states that phi has a solution, and the connectives on problems are interpreted as in Kleene realizability. Three variants are studied: the arithmetical semantics I (provability in PA), its external version E (truth in the standard model), and the set-theoretic semantics B over ZF, where problem variables are โblack boxesโ and a quantifier Pi over them is available. Validity is defined as the existence of a computable
![We investigate the interplay between homological algebra and combinatorial set theory, specifically focusing on the (non)vanishing of higher derived limits of certain inverse systems of abelian groups, denoted ๐[ฮบ]ฮป, indexed by the ordered sets ([ฮบ]ฮป,โ), where ฮป< ฮบ are infinite cardinals. Our first main result is a general structural theorem which provides a generalisation of Goblot's theorem to the setting of locally small directed sets. We then present the first systematic study of generalised cofinal Kurepa families. We establish their existence in the constructible universe L and under specific cardinal arithmetic hypotheses. Then, we apply our structural result to show that limโฟโบยฒ C[ฮบ]โตโ = 0 in environments where the appropriate cofinal Kurepa families exist. In contrast, we explore conditions that force these derived limits to be nonzero. In particular, we prove that certain instances of Chang's conjecture (CC), together with the existence of suitable โข sequences, imply that lim](https://pbs.twimg.com/media/HXPngGMXcAAzmxe.png?name=small&format=webp)
ALT We investigate the interplay between homological algebra and combinatorial set theory, specifically focusing on the (non)vanishing of higher derived limits of certain inverse systems of abelian groups, denoted ๐[ฮบ]ฮป, indexed by the ordered sets ([ฮบ]ฮป,โ), where ฮป< ฮบ are infinite cardinals. Our first main result is a general structural theorem which provides a generalisation of Goblot's theorem to the setting of locally small directed sets. We then present the first systematic study of generalised cofinal Kurepa families. We establish their existence in the constructible universe L and under specific cardinal arithmetic hypotheses. Then, we apply our structural result to show that limโฟโบยฒ C[ฮบ]โตโ = 0 in environments where the appropriate cofinal Kurepa families exist. In contrast, we explore conditions that force these derived limits to be nonzero. In particular, we prove that certain instances of Chang's conjecture (CC), together with the existence of suitable โข sequences, imply that lim

ALT What can a logic certify about a copy of itself? For Church's simple theory of types, formalized as a deep embedding in Isabelle/HOL with Henkin semantics and a natural-deduction calculus, the answer has two tiers. On the first tier, plain Isabelle/HOL certifies the logic without an axiom of infinity, by a standard model with one individual. On the second tier, the logic with a Dedekind-style axiom of infinity is certified only in Isabelle/HOL extended by a large enough set-theoretic universe. Both tiers appear in Harrison's self-verification of HOL Light. What the present formalization adds is Henkin completeness, and with it a semantics that matches the calculus exactly, compactness and model existence on the first tier, and the boundary between the tiers. Comparing two ways of adding infinity to the object logic shows where the boundary lies. One is an infinite domain of individuals, expressed by the first-order sentences "there are at least n individuals", each of which has a finit





