Related papers: On a Hierarchy of Reflection Principles in Peano A…
Hoare's logic is an axiomatic system of proving programs correct, which has been extended to be a separation logic to reason about mutable heap structure. We develop the most fundamental logical structure of strongest postcondition of…
Given a reflection group $G$ acting on a complex vector space $V$, a reflection map is the composition of an embedding $X \hookrightarrow V$ with the orbit map $V\to\mathbb C^p$ that maps a $G$-orbit to a point. Reflection maps can be very…
Let $X$ be a nonempty real variety that is invariant under the action of a reflection group $G$. We conjecture that if $X$ is defined in terms of the first $k$ basic invariants of $G$ (ordered by degree), then $X$ meets a $k$-dimensional…
Separation logic is successful for software verification of heap-manipulating programs. Numbers are necessary to be added to separation logic for verification of practical software where numbers are important. However, properties of the…
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
We separate the Collection Principle, the Reflection Principle, and the Partial Reflection Principle in ZF with urelements (ZFU), despite their equivalence under the Axiom of Choice. In particular, Collection and the Partial Reflection…
We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…
According to Karl Popper assumptions are statements used to construct theories. During the construction of a theory whether the assumptions are either true or false turn out to be irrelevant in view of the fact that, actually, they gain…
We present the classification of reflective quadratic forms $-px_0^2+x_1^2+\ldots+x_n^2$ for $p$ prime. We show that for $p = 5$, it is reflective for $2\leq n\leq 8$, for $p = 7\text{ and }17$ it is reflective for $n = 2\text{ and }3$, for…
A stationary subset S of a regular uncountable cardinal kappa reflects fully at regular cardinals if for every stationary set T subseteq kappa of higher order consisting of regular cardinals there exists an alpha in T such that S cap alpha…
This is an exposition of facts about Arithmetic with an approach via mathematical logic. In Section 1 we present Peano Arithmetic, PA, and the complete theory of $\mathbb{N}$, and we show that $\mathbb{N}$ is a prime model of the theory of…
We present an alternative cyclic proof system for Peano arithmetic that could be simpler than the existing ones and well-adapted both for proof analysis and for automatizing inductive proof search. In addition, we will show how various…
Argumentation is the process of constructing arguments about propositions, and the assignment of statements of confidence to those propositions based on the nature and relative strength of their supporting arguments. The process is modelled…
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…
Strong reflection principles with the reflection cardinal $\leq\aleph_1$ or $<2^{\aleph_0}$ imply that the size of the continuum is either $\aleph_1$ or $\aleph_2$ or very large. Thus, the stipulation, that a strong reflection principle…
If $S,T$ are stationary subsets of a regular uncountable cardinal $\kappa$, we say that $S$ reflects fully in $T$, $S<T$, if for almost all $\alpha \in T$ (except a nonstationary set) $S \cap \alpha$ is stationary in $\alpha .$ This…
Let $W$ be a rank $n$ irreducible finite reflection group and let $p_1(x),\ldots,p_n(x)$, $x\in\mathbb{R}^n$, be a basis of algebraically independent $W$-invariant real homogeneous polynomials. The orbit map $\overline…
The $Reflection$ $Calculus$ ($\mathcal{\mathbf{RC}}$) is the fragment of the polymodal logic $\mathcal{\mathbf{GLP}}$ in the language $L^+$ whose formulas are built up from $\top$ and propositional variables using conjunction and diamond…
The Recurrence Axiom for a class $\mathcal{P}$ of \pos\ and a set $A$ of parameters is an axiom scheme in the language of ZFC asserting that if a statement with parameters from $A$ is forced by a poset in $\mathcal{P}$, then there is a…