Related papers: Consistency Strengths of Modified Maximality Princ…
In this paper, we investigate the strong maximum principle for generalized solutions of Monge-Amp\`ere type equations. We prove that the strong maximum principle holds at points where the function is strictly convex but not necessarily…
This paper is the extended version of On the Complexity of Infinite Advice Strings (ICALP 2018). We investigate a notion of comparison between infinite strings. In a general way, if M is a computation model (e.g. Turing machines) and C a…
The purpose of this paper is to present a general method for forcing on $\omega_2$ and $\omega_3$ with finite conditions, while preserving all cardinals and some fragments of $\mathrm{GCH}$. This method is based on the technique of forcing…
We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…
This paper is concerned with equilibrium configurations of one-dimensional particle system with non-convex nearest-neighbour and next-to-nearest-neighbour interactions and its passage to the continuum. The goal is to derive compactness…
We demonstrate that gamma (from the Lorentz transformation of the Special Theory of Relativity) acts as an impediment to velocity changes only when it occurs inside motion energy transfer relationships. We also examine whether or not gamma…
Limiters are nonlinear hybridization techniques that are used to preserve positivity and monotonicity when numerically solving hyperbolic conservation laws. Unfortunately, the original methods suffer from the truncation-error being…
We develop a general field-covariant approach to quantum gauge theories. Extending the usual set of integrated fields and external sources to "proper" fields and sources, which include partners of the composite fields, we define the master…
In this workshop, we present a compact but rigorous introduction to the basic language of nonlinear programming, variational inequalities, and complementarity systems. The goal is twofold. First, we explain the mathematical logic of…
We present a higher order generalized (gravitational) uncertainty principle (GUP) in the form $[X,P]=i\hbar/(1-\beta P^2)$. This form of GUP is consistent with various proposals of quantum gravity such as string theory, loop quantum…
We introduce new first-order necessary conditions for mathematical programs with complementarity constraints (MPCCs), which lie between strong and M-stationarity and have a relatively simple description. We show that they hold for local…
A classical theorem of Hechler asserts that the structure $\left(\omega^\omega,\le^*\right)$ is universal in the sense that for any $\sigma$-directed poset P with no maximal element, there is a ccc forcing extension in which…
Much of the power of probabilistic methods in modelling language comes from their ability to compare several derivations for the same string in the language. An important starting point for the study of such cross-derivational properties is…
Forcing axioms are generalizations of Baire category principles that allow one to intersect more dense open sets and to do so in a wider variety of circumstances. In this paper we introduce two new forcing axioms related to posets which…
We describe a flexible construction that produces triples of finitely generated, residually finite groups $M\hookrightarrow P \hookrightarrow \Gamma$, where the maps induce isomorphisms of profinite completions…
We define a nontrivial version of the square principle $\Box_\omega$, which we then show consistent by means of forcing with finite conditions. This paper has been withdrawn by the author due to the fact that the presented $\Box_\omega$ can…
Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…
We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…
Model Predictive Control (MPC) is a successful control methodology, which is applied to increasingly complex systems. However, real-time feasibility of MPC can be challenging for complex systems, certainly when an (extremely) large number…
The intrinsic conformality is a general property of the renormalizable gauge theory, which ensures the scale-invariance of a fixed-order series at each perturbative order. Following the idea of intrinsic conformality, we suggest a novel…