共查询到20条相似文献,搜索用时 171 毫秒
1.
R. Gregory Taylor 《Journal of Philosophical Logic》2008,37(6):575-591
Symmetric propositions over domain and signature are characterized following Zermelo, and a correlation of such propositions with logical type- quantifiers over is described. Boolean algebras of symmetric propositions over and Σ are shown to be isomorphic to algebras of logical type- quantifiers over . This last result may provide empirical support for Tarski’s claim that logical terms over fixed domain are all and only
those invariant under domain permutations. 相似文献
2.
This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language
with a distinguished unary predicate c(x), function-symbols , · and – and constants 0 and 1 is defined. An interpretation
for
is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as region x is connected and the function-symbols and constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation
based on the real closed plane which turns out to be isomorphic to
A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation. 相似文献
3.
Marta A. Zander 《Studia Logica》2008,88(2):233-246
In this paper we prove that, for n > 1, the n-generated free algebra in any locally finite subvariety of HoRA can be written in a unique nontrivial way as Ł2 × A′, where A′ is a directly indecomposable algebra in . More precisely, we prove that the unique nontrivial pair of factor congruences of is given by the filters and , where the element is recursively defined from the term introduced by W. H. Cornish. As an additional result we obtain a characterization of minimal irreducible filters of in terms of its coatoms.
Presented by Daniele Mundici 相似文献
4.
We investigate an expansion of quasi-MV algebras ([10]) by a genuine quantum unary operator. The variety of such
quasi-MV algebras has a subquasivariety whose members—called cartesian—can be obtained in an appropriate way out of MV algebras. After showing that cartesian . quasi-MV algebras generate ,we prove a standard completeness theorem for w.r.t. an algebra over the complex numbers.
Presented by Heinrich Wansing 相似文献
5.
We present some equivalent conditions for a quasivariety of structures to be generated by a single structure. The first such condition, called the embedding property was found by A.I. Mal′tsev in [6]. It says that if are nontrivial, then there exists such that A and B are embeddable into C. One of our equivalent conditions states that the set of quasi-identities valid in is closed under a certain Gentzen type rule which is due to J. Łoś and R. Suszko [5].
Presented by Jacek Malinowski 相似文献
6.
Heinrich Wansing 《Journal of Philosophical Logic》2006,35(6):653-660
Many logical systems are such that the addition of Prior's binary connective to them leads to triviality, see [1, 8]. Since is given by some introduction and elimination rules in natural deduction or sequent rules in Gentzen's sequent calculus, the unwanted effects of adding show that some kind of restriction has to be imposed on the acceptable operational inferences rules, in particular if these rules are regarded as definitions of the operations concerned. In this paper, a number of simple observations is made showing that the unwanted phenomenon exemplified by in some logics also occurs in contexts in which
is acceptable. In fact, in any non-trivial context, the acceptance of arbitrary introduction rules for logical operations permits operations leading to triviality. Connectives that in all non-trivial contexts lead to triviality will be called non-trivially trivializing connectives. 相似文献
7.
Ming Hsiung 《Journal of Philosophical Logic》2008,37(4):299-317
By introducing the intensional mappings and their properties, we establish a new semantical approach of characterizing intermediate
logics. First prove that this new approach provides a general method of characterizing and comparing logics without changing
the semantical interpretation of implication connective. Then show that it is adequate to characterize all Kripke_complete
intermediate logics by showing that each of these logics is sound and complete with respect to its (unique) ‘weakest characterization
property’ of intensional mappings. In particular, we show that classical logic has the weakest characterization property , which is the strongest among all possible weakest characterization properties of intermediate logics. Finally, it follows
from this result that a translation is an embedding of classical logic into intuitionistic logic, iff. its semantical counterpart
has the property .
相似文献
8.
Let
be a finite collection of finite algebras of finite signature such that SP(
) has meet semi-distributive congruence lattices. We prove that there exists a finite collection
1 of finite algebras of the same signature,
, such that SP(
1) is finitely axiomatizable.We show also that if
, then SP(
1) is finitely axiomatizable. We offer new proofs of two important finite basis theorems of D. Pigozzi and R. Willard. Our actual results are somewhat more general than this abstract indicates.While working on this paper, the first author was partially supported by the Hungarian National Foundation for Scientific Research (OTKA) grant no. T37877 and the second author was supported by the US National Science Foundation grant no. DMS-0245622.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
9.
Xuefeng Wen 《Studia Logica》2007,85(2):251-260
We construct a a system PLRI which is the classical propositional logic supplied with a ternary construction , interpreted as the intensional identity of statements and in the context . PLRI is a refinement of Roman Suszko’s sentential calculus with identity (SCI) whose identity connective is a binary one.
We provide a Hilbert-style axiomatization of this logic and prove its soundness and completeness with respect to some algebraic
models. We also show that PLRI can be used to give a partial solution to the paradox of analysis.
Presented by Jacek Malinowski 相似文献
10.
Tarek Sayed Ahmed 《Studia Logica》2007,85(2):139-151
SC, CA, QA and QEA denote the class of Pinter’s substitution algebras, Tarski’s cylindric algebras, Halmos’ quasi-polyadic
and quasi-polyadic equality algebras, respectively. Let . and . We show that the class of n dimensional neat reducts of algebras in K
m
is not elementary. This solves a problem in [2]. Also our result generalizes results proved in [1] and [2].
Presented by Robert Goldblatt 相似文献
11.
Christopher Steinsvold 《Journal of Philosophical Logic》2008,37(1):45-56
Patrick Grim has presented arguments supporting the intuition that any notion of a totality of truths is incoherent. We suggest
a natural semantics for various logics of belief which reflect Grim’s intuition. The semantics is a topological semantics,
and we suggest that the condition can be interpreted to reflect Grim’s intuition. Beyond this, we present a natural canonical topological model for
K4 and KD4. 相似文献
12.
Katalin Bimbó 《Journal of Philosophical Logic》2005,34(5-6):607-620
The implicational fragment of the relevance logic “ticket entailment” is closely related to the so-called hereditary right
maximal terms. I prove that the terms that need to be considered as inhabitants of the types which are theorems of T→ are in normal form and built in all but one case from
and
only. As a tool in the proof ordered term rewriting systems are introduced. Based on the main theorem I define FIT→ – a Fitch-style calculus (related to FT→) for the implicational fragment of ticket entailment. 相似文献
13.
Alexander Budkin 《Studia Logica》2004,78(1-2):107-127
The dominion of a subalgebra H in an universal algebra A (in a class
) is the set of all elements
such that for all homomorphisms
if f, g coincide on H, then af = ag. We investigate the connection between dominions and quasivarieties. We show that if a class
is closed under ultraproducts, then the dominion in
is equal to the dominion in a quasivariety generated by
. Also we find conditions when dominions in a universal algebra form a lattice and study this lattice.Special issue of Studia Logica: Algebraic Theory of Quasivarieties Presented by
M. E. Adams, K. V. Adaricheva, W. Dziobiak, and A. V. Kravchenko 相似文献
14.
A logic of intention and attempt 总被引:3,自引:1,他引:2
We present a modal logic called (logic of intention and attempt) in which we can reason about intention dynamics and intentional action execution. By exploiting
the expressive power of , we provide a formal analysis of the relation between intention and action and highlight the pivotal role of attempt in action execution. Besides, we deal with the problems of instrumental reasoning and intention persistence. 相似文献
15.
Marc Pauly 《Synthese》2007,158(2):233-250
We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order
to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures.
In this language, the formula
expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making.
Here we investigate majority voting, where holds if a majority of individuals accepts, consensus voting, where holds if all individuals accept, and dictatorship. We provide complete axiomatizations for judgment sets arising from all three aggregation procedures. 相似文献
16.
First we show that the classical two-player semantic game actually corresponds to a three-valued logic. Then we generalize
this result and give an n-player semantic game for an n + 1-valued logic with n binary connectives, each associated with a player. We prove that player i has a winning strategy in game if and only if the truth value of is t
i
in the model M, for 1 ≤ i ≤ n; and none of the players has a winning strategy in if and only if the truth value of is t
0 in M. 相似文献
17.
S. K. Thomason 《Journal of Philosophical Logic》1989,18(1):43-67
Conclusions and conjectures Some may be of the opinion that one event can begin before another only by virtue of the existence of some event (a witness) which wholly precedes the other and does not wholly precede the one (and similarly for ends before and does not abut). Those would prefer
0 to
as a model for observers' apprehensions of events. Since G is a functor from
to
0, the current construction (restricted to
0) remains applicable.This work supports a claim that the psychologically fundamental temporal relationships are wholly precedes, begins before, ends before and abuts. But only in a very weak sense. Any other set of relationships which is interdefinable with this one, using only quantifier-free formulas in the definitions, could be used to define a category
which is indistinguishable from
(because the same functions preserve and reflect the new relationships). This work equally supports the claim that those relationships are the psychologically fundamental ones, or the claim that it is just wholly precedes which is fundamental, and that we perceive begins before just by virtue of witnesses. But it refutes the claim that only wholly precedes is fundamental, and that we understand begins before only because we understand time as a linear ordering. 相似文献
18.
J. Michael Dunn 《Studia Logica》1979,38(2):149-169
Given classical (2 valued) structures
and
and a homomorphism h of
onto
, it is shown how to construct a (non-degenerate) 3-valued counterpart
of
. Classical sentences that are true in
are non-false in
. Applications to number theory and type theory (with axiom of infinity) produce finite 3-valued models in which all classically true sentences of these theories are non-false. Connections to relevant logic give absolute consistency proofs for versions of these theories formulated in relevant logic (the proof for number theory was obtained earlier by R. K. Meyer and suggested the present abstract development). 相似文献
19.
Fernando Guzmán 《Studia Logica》1994,53(2):243-257
Conditional logic is the deductive system
, where
is the set of propositional connectives {, ,} and is the structural finitary consequence relation on the absolutely free algebra
that preserves degrees of truth over the structure of truth values C, . HereC is the non-commutative regular extension of the 2-element Boolean algebra to 3 truth values {t, u, f}, andf<u<t. In this paper we give a Gentzen type axiomatization for conditional logic.Presented byJan Zygmunt 相似文献
20.
Nicholas Long Barbara-Jeanne Austin Mary M. Gound Abesie O. Kelly Adrienne A. Gardner Rick Dunn Stacy B. Harris Kim S. Miller 《Journal of child and family studies》2004,13(1):47-65
The Parents Matter! Program (PMP) has developed three interventions for parents of 4th and 5th grade African-American children (9–12 years old). The overarching goal of all three interventions is to provide parents with knowledge, skills, and support for enhancing their efforts to raise healthy children. The interventions are: (1) Enhanced Communication and Parenting (five 2
-hour sessions), (2) Brief Communication and Parenting (single 2
-hour session), and (3) General Health (single 2
-hour session). This article discusses the development of these interventions, presents an overview of the content of each intervention, and discusses issues related to the facilitation/presentation of these interventions. 相似文献