相关论文: Suszko's Problem: Mixed Consequence and Compositio…

The replicability crisis has drawn attention to numerous weaknesses in psychology and social science research practice. In this work we focus on three issues that cannot be addressed with replication alone, and which deserve more attention:…

The general setting of this work is the constraint-based synthesis of termination arguments. We consider a restricted class of programs called lasso programs. The termination argument for a lasso program is a pair of a ranking function and…

Sorkin's coevent interpretation shifts the focus of quantum logic from the structure of a propositional lattice to the nature of truth valuations thereon. We apply this shift in emphasis to a simple formulation of the consistent histories…

In many situations humans have to reason with inconsistent knowledge. These inconsistencies may occur due to not fully reliable sources of information. In order to reason with inconsistent knowledge, it is not possible to view a set of…

This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…

In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…

Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…

We introduce a new propositional logic, called very weak subintuitionistic logic $\mathbf{VF}$, by adapting the relational semantics of Fitting, Marek, and Truszczy\'nski for the pure logic of necessitation $\mathbf{N}$ to the propositional…

Economic theory implies strong limitations on what types of consumption behavior are considered rational. Rationality implies that the Slutsky matrix, which captures the substitution effects of compensated price changes on demand for…

Accounting for the epistemic contribution of deduction has been a pervasive problem for logicians interested in deduction, such as, among others, Jakko Hintikka. The problem arises because the conclusion validly deduced from a set of…

Inspired by the classical Riemannian systolic inequality of Gromov we present a combinatorial analogue providing a lower bound on the number of vertices of a simplicial complex in terms of its edge-path systole. Similarly to the Riemannian…

I review evidence for the claim that syntactic ambiguities are resolved on the basis of the meaning of the competing analyses, not their structure. I identify a collection of ambiguities that do not yet have a meaning-based account and…

The word order of a sentence is shaped by multiple principles. The principle of syntactic dependency distance minimization is in conflict with the principle of surprisal minimization (or predictability maximization) in single head syntactic…

Intercausal reasoning is a common inference pattern involving probabilistic dependence of causes of an observed common effect. The sign of this dependence is captured by a qualitative property called product synergy. The current definition…

We introduce an S.o.S hierarchy of lower bounds for a polynomial optimization problem whose constraint is expressed as a matrix polynomial semidefinite inequality. Our approach involves utilizing a penalty function framework to directly…

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from…

We address an old open question in convex geometry that dates back to the work of Minkowski: what are the equality cases of the monotonicity of mixed volumes? The problem is equivalent to that of providing a geometric characterization of…

We prove the Duality Theorems for the stochastic optimal transportation problems with a convex cost function without a regularity assumption that is often supposed in the proof of the lower semicontinuity of an action integral. In our new…

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…