English
Related papers

Related papers: Thorn-Forking in Continuous Logic

200 papers

In a previous paper we developed the notions of th-independence and \th-ranks which define a geometric independence relation in a class of theories which we called ``rosy''. We proved that rosy theories include simple and o-minimal theories…

Logic · Mathematics 2007-05-23 Alf Onshuus

We characterize model theoretic properties of the Urysohn sphere as a metric structure in continuous logic. In particular, our first main result shows that the theory of the Urysohn sphere is $\text{SOP}_n$ for all $n\geq 3$, but does not…

Logic · Mathematics 2018-08-17 Gabriel Conant , Caroline Terry

An axiomatic treatment of `independence relations' (notions of independence) for complete first-order theories is presented, the principal examples being forking (due to Shelah) and thorn-forking (due to Onshuus). Thorn-forking is…

Logic · Mathematics 2007-05-23 Hans Adler

In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…

Logic · Mathematics 2023-06-27 James Hanson

We prove that a theory $T$ has stable forking if and only if $T^\mathrm{eq}$ has stable forking.

Logic · Mathematics 2015-08-11 Enrique Casanovas , Joris Potier

Forking is a central notion of model theory, generalizing linear independence in vector spaces and algebraic independence in fields. We develop the theory of forking in abstract, category-theoretic terms, for reasons both practical (we…

Logic · Mathematics 2019-02-19 Michael Lieberman , Jiří Rosický , Sebastien Vasey

We classify, in a non-trivial amenable collection of functors, all 2-chains up to the relation of having the same 1-shell boundary. In particular, we prove that in a rosy theory, every 1-shell of a Lascar strong type is the boundary of some…

Logic · Mathematics 2015-03-17 Byunghan Kim , SunYoung Kim , Junguk Lee

We show how the description of a shear-free ray congruence in Minkowski space as an evolving family of semi-conformal mappings can naturally be formulated on a finite graph. For this, we introduce the notion of holomorphic function on a…

Mathematical Physics · Physics 2015-05-18 Paul Baird , Mohammad Wehbe

We demonstrate that for the $k$-variable theory $T$ of a finite structure (satisfying certain amalgamation conditions), if finite models of $T$ can be recovered from diagrams of finite {\em subsets} of model of $T$ in a certain "efficient"…

Logic · Mathematics 2012-10-31 Cameron Donnay Hill

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

Logic · Mathematics 2026-03-11 Itaï Ben Yaacov , Tomás Ibarlucía

In this paper we explore the following question: how weak can a logic be for Rosser's essential undecidability result to be provable for a weak arithmetical theory? It is well known that Robinson's Q is essentially undecidable in…

Logic · Mathematics 2020-06-23 Guillermo Badia , Petr Cintula , Petr Hajek , Andrew Tedder

A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality…

Logic · Mathematics 2020-09-21 Amador Martin-Pizarro , Martin Ziegler

A. Tarski proposed the study of infinitary consequence operations as the central topic of mathematical logic. He considered monotonicity to be a property of all such operations. In this paper, we weaken the monotonicity requirement and…

Artificial Intelligence · Computer Science 2007-05-23 Michael Freund , Daniel Lehmann

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani

Fuzziness and randomicity widespread exist in natural science, engineering, technology and social science. The purpose of this paper is to present a new logic - uncertain propositional logic which can deal with both fuzziness by taking…

Logic · Mathematics 2015-06-11 Maokang Luo , Wei He

We characterize thorn-independence in a variety of structures, focusing on the field of real numbers expanded by predicate defining a dense multiplicative subgroup, G, satisfying the Mann property and whose pth powers are of finite index in…

Logic · Mathematics 2007-06-28 Alexander Berenstein , Clifton Ealy , Ayhan Günaydin

This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…

Geometric Topology · Mathematics 2009-09-29 Louis H. Kauffman , Sofia Lambropoulou

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

Programming Languages · Computer Science 2024-08-22 Michał J. Gajda

Twist tori are examples of exotic monotone lagrangian tori, presented in [1]. This tree of examples grew up over the first one --- the torus $\Theta \in \R^4$, constructured in [2] and [3]. On the other hand, in [4] and [5] we proposed a…

Symplectic Geometry · Mathematics 2015-05-18 Nikolay A. Tyurin

Our experiments on a sphere falling under gravity in Stokes flow show significant history effects. We observe an algebraic, not exponential, relaxation rate to the terminal velocity, validating the solution to the Basset-Boussinesq-Oseen…

Fluid Dynamics · Physics 2025-06-18 Tomek Jaroslawski , Divya Jaganathan , Rama Govindarajan , Beverley McKeon
‹ Prev 1 2 3 10 Next ›