Related papers: Set-theoretic reflection is equivalent to inductio…

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

Some basic features of the simultaneous inclusion of discrete fibrations and discrete opfibrations in categories over a base category X are considered. In particular, we illustrate the formulas (|P)x = ten(x/X,P) ; (P|)x = hom(X/x,P) which…

Reflection positivity constitutes an integral prerequisite in the Osterwalder-Schrader reconstruction theorem which relates quantum field theories defined on Euclidean space to their Lorentzian signature counterparts. In this work we…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

I have argued elsewhere that second order logic provides a foundation for mathematics much in the same way as set theory does, despite the fact that the former is second order and the latter first order, but second order logic is marred by…

Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…

A transduction provides us with a way of using the monadic second-order language of a structure to make statements about a derived structure. Any transduction induces a relation on the set of these structures. This article presents a…

When teaching an elementary logic course to students who have a general scientific background but have never been exposed to logic, we have to face the problem that the notions of deduction rule and of derivation are completely new to them,…

We show that the category O for a rational Cherednik algebra of type A is equivalent to modules over a q-Schur algebra (parameter not a half integer), providing thus character formulas for simple modules. We give some generalization to…

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

It is known that reflection coefficients for bulk fields of a rational conformal field theory in the presence of an elementary boundary condition can be obtained as representation matrices of irreducible representations of the classifying…

Let $\mathcal{A} = \mathcal{A}(W)$ be the reflection arrangement of the finite complex reflection group $W$. By Terao's famous theorem, the arrangement $\mathcal{A}$ is free. In this paper we classify all reflection arrangements which…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

We prove several reflection theorems on $D$-spaces, which are Hausdorff topological spaces $X$ in which for every open neighbourhood assignment $U$ there is a closed discrete subspace $D$ such that \[ \bigcup\{U(x): x\in D\}=X. \] The…

We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…

We introduce and axiomatize the notion of a reflective cardinal, use it to give semantics to higher order set theory, and explore connections between the notion of reflective cardinals and large cardinal axioms.

Let $M =(M_t)_{t\geq 0}$ be any continuous real-valued stochastic process. We prove that if there exists a sequence $(a_n)_{n\geq 1}$ of real numbers which converges to 0 and such that $M$ satisfies the reflection property at all levels…