Related papers: Maximality of logic without identity
We prove that, for each non null countable ordinal alpha, there exist some Sigma^0_alpha-complete omega-powers, and some Pi^0_alpha-complete omega-powers, extending previous works on the topological complexity of omega-powers. We prove…
Developing suitable formal semantics can be of great help in the understanding, design and implementation of a programming language, and act as a guide for software development tools like analyzers or partial evaluators. In this sense, full…
We consider an extension of logic programs, called \omega-programs, that can be used to define predicates over infinite lists. \omega-programs allow us to specify properties of the infinite behavior of reactive systems and, in general,…
Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…
We review some basic facts on vector fields, in the complex-analytic setting, thus, obtaining a rationality result and an extension of the Birkhoff-Grothendieck theorem, as follows: (1) Let $Z$ be a compact complex manifold endowed with a…
In this paper we study identities and images of polynomials on null-filiform Leibniz algebras. If $L_n$ is an $n$-dimensional null-filiform Leibniz algebra, we exhibit a finite minimal basis for $\mbox{Id}(L_n)$, the polynomial identities…
The dual character of invariance under transformations and definability by some operations has been used in classical work by for example Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves…
Recently, in [DvZa], we have introduced $EMV$-algebras which resemble $MV$-algebras but the top element is not guaranteed for them. For $\sigma$-complete $EMV$-algebras, we prove an analogue of the Loomis--Sikorski Theorem showing that…
Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
We describe the isomorphism classes of infinite-dimensional graded Lie algebras of maximal class, generated by elements of weight one, over fields of odd characteristic.
The signature of closed oriented manifolds is well-known to be multiplicative under finite covers. This fails for Poincar\'e complexes as examples of C. T. C. Wall show. We establish the multiplicativity of the signature, and more…
We provide two proofs of the compactness theorem for extensions of first-order logic based on team semantics. First, we build upon L\"uck's ultraproduct construction for team semantics and prove a suitable version of {\L}o\'s' Theorem.…
We show that if f is a nonzero, noninvertible function on a smooth complex variety X and J_f is the Jacobian ideal of f, then lct(f, J_f^2)>1 if and only if the hypersurface defined by f has rational singularities. Moreover, if this is not…
We say that a logic L has the Lyndon positivity property (LPP) if all formulas which are monotone in L (that is, are preserved under increasing the valuation on L-algebras) are L-equivalent to positive formulas (formulas without negation…
We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…
We prove preservation theorems for $\mathcal{L}_{\omega_1, G}$, the countable fragment of Vaught's closed game logic. These are direct generalizations of the theorems of \L{}o\'s-Tarski (resp. Lyndon) on sentences of $\mathcal{L}_{\omega_1,…
Suppose L is a relational language and P in L is a unary predicate. If M is an L-structure then P(M) is the L-structure formed as the substructure of M with domain {a: M models P(a)}. Now suppose T is a complete first order theory in L with…
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
Sandqvist gave a proof-theoretic semantics (P-tS) for classical logic (CL) that explicates the meaning of the connectives without assuming bivalance. Later, he gave a semantics for intuitionistic propositional logic (IPL). While soundness…