相关论文: Priority arguments via true strages
We consider pushdown systems that store, instead of a single word, a Mazurkiewicz trace on its stack. These systems are special cases of valence automata over graph monoids and subsume multi-stack systems. We identify a class of such…
In this paper, we give corrected and improved definitions of the sets $S$ and $\Delta$ compared to [1]. By using these new definitions, we go throughout the proof of the main result in [1], and we correct it.
Given a regular cardinal $\kappa$ such that $\kappa^{<\kappa}=\kappa$ (e.g., if the Generalized Continuum Hypothesis holds), we develop a proof system for classical infinitary logic that includes heterogeneous quantification (i.e., infinite…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
A narrow system is a combinatorial object introduced by Magidor and Shelah in connection with work on the tree property at successors of singular cardinals. In analogy to the tree property, a cardinal $\kappa$ satisfies the \emph{narrow…
We present a new fragment of axiomatic set theory for pure sets and for the iteration of power sets within given transitive sets. It turns out that this formal system admits an interesting hierarchy of models with true membership relation…
We consider the explicit fragment of the basic justification stit logic introduced in earlier publications. We define a Hilbert-style axiomatic system for this logic and show that this system is strongly complete relative to the intended…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…
We present a categorical framework for formal systems in which inference rules with $m$ metavariables over a category of syntax $\mathscr{S}$, taken to be a cartesian PROP, are represented by operations of arity $k \to n$ equipped with…
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
This talk is a sneak preview of the project, 'proof theory for theories of ordinals'. Background, aims, survey and furture works on the project are given. Subsystems of second order arithmetic are embedded in recursively large ordinals and…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…
We introduce stratified labelings as a novel semantical approach to abstract argumentation frameworks. Compared to standard labelings, stratified labelings provide a more fine-grained assessment of the controversiality of arguments using…
We develop formal theories of conversion for Church-style lambda-terms with Pi-types in first-order syntax using one-sorted variables names and Stoughton's multiple substitutions. We then formalize the Pure Type Systems along some…
The chaotic hypothesis discussed in [GC1] is tested experimentally in a simple conduction model. Besides a confirmation of the hypothesis predictions the results suggest the validity of the hypothesis in the much wider context in which, as…
We define and study logics in the framework of probabilistic team semantics and over metafinite structures. Our work is paralleled by the recent development of novel axiomatizable and tractable logics in team semantics that are closed under…
We continue the research of an extension $\widetilde{\mid}$ of the divisibility relation to the Stone-\v Cech compactification $\beta N$. First we prove that ultrafilters we call prime actually possess the algebraic property of primality.…
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…