Related papers: Cartagena Logic

This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…

We prove that the semantics of intuitionistic linear logic in vector spaces which uses cofree coalgebras is also a model of differential linear logic, and that the Cartesian closed category of cofree coalgebras is a model of the…

We study conditions on automorphisms of Boolean algebras of the form $P(\lambda)/I_\kappa$ (where $\lambda$ is an uncountable cardinal and $I_\kappa$ is the ideal of sets of cardinality less than $\kappa$) which allow one to conclude that a…

We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…

We introduce an analog to the notion of Polish space for spaces of weight $\leq\kappa$, where $\kappa$ is an uncountable regular cardinal such that $\kappa^{<\kappa}=\kappa$. Specifically, we consider spaces in which player II has a winning…

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

The concept of complementarity in combination with a non-Boolean calculus of propositions refers to a pivotal feature of quantum systems which has long been regarded as a key to their distinction from classical systems. But a non-Boolean…

A criterion is given for a type in a finite rank stable theory to be (almost) internal to a given nonmodular minimal type. The motivation comes from results of Campana which give criteria for compact complex analytic spaces to be algebraic…

In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…

We extend to singular cardinals the model-theoretical relation $\lambda \stackrel{\kappa}{\Rightarrow} \mu$ introduced in P. Lipparini, The compactness spectrum of abstract logics, large cardinals and combinatorial principles, Boll. Unione…

We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that…

Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…

Let $A$ be an infinite set. Let $\Omega(A)$ be the algebra over $A$ where every constant is a fundamental constant and every finitary function is a fundamental operation. We shall give a method of representing any algebra $\mathcal{L}$ in…

Counting propositional logic was recently introduced in relation to randomized computation and shown able to logically characterize the full counting hierarchy. In this paper we aim to clarify the intuitive meaning and expressive power of…

The $\omega$-power of a finitary language L over a finite alphabet $\Sigma$ is the language of infinite words over $\Sigma$ defined by L $\infty$ := {w 0 w 1. .. $\in$ $\Sigma$ $\omega$ | $\forall$i $\in$ $\omega$ w i $\in$ L}. The…

We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions…

We prove the canonicity of inductive inequalities in a constructive meta-theory, for classes of logics algebraically captured by varieties of normal and regular lattice expansions. This result encompasses Ghilardi-Meloni's and Suzuki's…

Suppose L = {<, . . .} is any countable first order language in which < is interpreted as a linear order. Let T be any complete first order theory in the language L such that T has a kappa-like model where kappa is an inaccessible cardinal.…

In this paper you can explore the application of some notable Boolean-derived methods, namely the Disjunctive Normal Form representation of logic table expansions, and extend them to a real-valued logic model which is able to utilize…