Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

Coherence with respect to Kelly-Mac Lane graphs is proved for categories that correspond to the multiplicative fragment without constant propositions of classical linear first-order predicate logic without or with mix. To obtain this result, coherence is first established for categories that correspond to the multiplicative conjunction-disjunction fragment with first-order quantifiers of classi...

We give a combinatorial proof of a tight relationship between the Kanamori-McAloon principle and the Paris-Harrington theorem with a number-theoretic parameter function. We show that the provability of the parametrised version of the Kanamori-McAloon principle can exactly correspond to the relationship between Peano Arithmetic and the ordinal ε0 which stands for the proof-theoretic strength of ...

Brian Conrad kindly pointed out to us that the proof of Proposition 9.8 in the article in question is incomplete. We provide here the missing arguments together with a few other corrections and use the opportunity to indicate some new consequences of our results, and also mention some applications of the results in [S1]. In what follows, the supplementary references, including the original pape...

In the aforementioned article [S1], Brian Conrad kindly pointed out to us that the proof of Proposition 9.8 is incomplete. We provide here the missing arguments together with a few other corrections and use the opportunity to indicate some new consequences of our results, and also mention some applications of the results in [S1]. In what follows, the supplementary references, including the orig...

A correspondence is established between the basic elements of logic reasoning systems (knowledge bases, rules, inference and queries) and the structure and dynamical evolution laws of neural networks. The correspondence is pictured as a translation dictionary which might allow to go back and forth between symbolic and network formulations, a desirable step in learning-oriented systems and multi...

In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict contrary propositions which correspond to orthogonal commuting projections and which each have probability one. We also show that the formalism makes contrary proba...