Results for 'Aqua-Fit'

967 found
Order:
  1.  1
    The Development of Students' Lower Limb Strength through the Implementation of a Functional Training Program Using Aqua-Fit Equipment.Andreea- Maria Tasca & Dana Badau - 2025 - Postmodern Openings 15 (1):32-42.
    The aim of this study was to develop explosive strength in the lower limbs of students by implementing an experimental functional training program using Aqua-Fit equipment, specifically targeting university students enrolled in non-sports-related academic programs. This study was conducted over 14 weeks, structured: the first week of the initial test, 12 weeks of training, and the last week of the final test. A total of 40 students, aged 19-25, specializing in general medicine, participated in functional training sessions as part (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  13
    What Do Zendaya's Blue Eyes Really Mean?Edwardo Pérez - 2022-10-17 - In Kevin S. Decker, Dune and Philosophy. Wiley. pp. 14–23.
    Blue is a significant color in science fiction: Star Trek, Star Wars, Avatar, Marvel, and DC all have aliens, mutants, and superheroes that come in shades from aqua to cerulean to cobalt. In Dune, however, blue is not a skin tone, it is an eye color – not for aliens, but for humans. Specifically, it is meant to visualize and symbolize the Fremen, and anyone who is either addicted to spice or has been around it long enough for their (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  3. Grande Sertão: Veredas by João Guimarães Rosa.Felipe W. Martinez, Nancy Fumero & Ben Segal - 2013 - Continent 3 (1):27-43.
    INTRODUCTION BY NANCY FUMERO What is a translation that stalls comprehension? That, when read, parsed, obfuscates comprehension through any language – English, Portuguese. It is inevitable that readers expect fidelity from translations. That language mirror with a sort of precision that enables the reader to become of another location, condition, to grasp in English in a similar vein as readers of Portuguese might from João Guimarães Rosa’s GRANDE SERTÃO: VEREDAS. There is the expectation that translations enable mobility. That what was (...)
     
    Export citation  
     
    Bookmark  
  4.  28
    X-ray diffraction study of deformation by filing in B.C.C. refractory metals.E. N. Aqua & C. N. J. Wagner - 1964 - Philosophical Magazine 9 (100):565-589.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  5.  23
    Melvin Fitting, Types Tableaus and Gödel's God. [REVIEW]Melvin Fitting - 2005 - Studia Logica 81 (3):425-427.
    Direct download  
     
    Export citation  
     
    Bookmark   17 citations  
  6.  34
    Cue Effects on Memory for Location When Navigating Spatial Displays.Sylvia Fitting, Douglas H. Wedell & Gary L. Allen - 2009 - Cognitive Science 33 (7):1267-1300.
    Participants maneuvered a rat image through a circular region on the computer screen to find a hidden target platform, blending aspects of two well-known spatial tasks. Like the Morris water maze task, participants first experienced a series of learning trials before having to navigate to the hidden target platform from different locations and orientations. Like the dot-location task, they determined the location of a position within a two-dimensional circular region. This procedure provided a way to examine how the number of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  7.  89
    First-Order Modal Logic.Melvin Fitting & Richard L. Mendelsohn - 1998 - Dordrecht, Netherland: Kluwer Academic Publishers.
    This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   110 citations  
  8.  75
    Proof Methods for Modal and Intuitionistic Logics.Melvin Fitting - 1985 - Journal of Symbolic Logic 50 (3):855-856.
  9. Russell’s Paradox, Gödel’s Theorem.Melvin Fitting - 2017 - In Brian Rayman & Melvin Fitting, Raymond Smullyan on Self Reference. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  10.  66
    Possible world semantics for first-order logic of proofs.Melvin Fitting - 2014 - Annals of Pure and Applied Logic 165 (1):225-240.
    In the tech report Artemov and Yavorskaya [4] an elegant formulation of the first-order logic of proofs was given, FOLP. This logic plays a fundamental role in providing an arithmetic semantics for first-order intuitionistic logic, as was shown. In particular, the tech report proved an arithmetic completeness theorem, and a realization theorem for FOLP. In this paper we provide a possible-world semantics for FOLP, based on the propositional semantics of Fitting [5]. We also give an Mkrtychev semantics. Motivation and intuition (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  11.  47
    Intuitionistic logic, model theory and forcing.Melvin Fitting - 1969 - Amsterdam,: North-Holland Pub. Co..
  12.  34
    An axiomatic approach to computers.Melvin C. Fitting - 1979 - Theoria 45 (3):97-113.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  24
    Ambiguities in Feldman's Desert-adjusted Values.I. Justice As Fit - 1995 - Philosophy and Phenomenological Research 55:567-85.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14. Databases and Higher Types.Melvin Fitting - unknown
    Generalized databases will be examined, in which attributes can be sets of attributes, or sets of sets of attributes, and other higher type constructs. A precise semantics will be developed for such databases, based on a higher type modal/intensional logic.
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  15. Essays for Raymond Smullyan.Melvin Fitting (ed.) - 2017
    No categories
     
    Export citation  
     
    Bookmark  
  16. Higher-Order Modal Logic—A Sketch.Melvin Fitting - unknown
    First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal logic: its formal semantics, and a proof procedure (...)
     
    Export citation  
     
    Bookmark  
  17.  72
    How True It Is = Who Says It’s True.Melvin Fitting - 2009 - Studia Logica 91 (3):335-366.
    This is a largely expository paper in which the following simple idea is pursued. Take the truth value of a formula to be the set of agents that accept the formula as true. This means we work with an arbitrary Boolean algebra as the truth value space. When this is properly formalized, complete modal tableau systems exist, and there are natural versions of bisimulations that behave well from an algebraic point of view. There remain significant problems concerning the proper formalization, (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  18.  40
    Linear reasoning in modal logic.Melvin Fitting - 1984 - Journal of Symbolic Logic 49 (4):1363-1378.
  19. Numbers.Melvin Fitting & Greer Fitting - 1990
     
    Export citation  
     
    Bookmark  
  20. S4lp and local realizability.Melvin Fitting - unknown
    The logic S4LP combines the modal logic S4 with the justification logic LP, both axiomatically and semantically. We introduce a simple restriction on the behavior of constants in S4LP, having no effect on the LP sublogic. Under this restriction some powerful derived rules are established. Then these are used to show completeness relative to a semantics having what we call the local realizability property: at each world and for each formula true at that world there is a realization also true (...)
     
    Export citation  
     
    Bookmark   1 citation  
  21. Tableaus for Logic Programming.Melvin Fitting - unknown
    We present a logic programming language, which we call Proflog, with an operational semantics based on tableaus, and a denotational semantics based on supervaluations. We show the two agree. Negation is well-behaved, and semantic non-computability issues do not arise. This is accomplished essentially by dropping a domain closure requirement. The cost is that intuitions developed through the use of classical logic may need modification, though the system is still classical at a level once removed. Implementation problems are discussed very briefly (...)
     
    Export citation  
     
    Bookmark   1 citation  
  22. Bilattices and the Semantics of Logic Programming.Melvin Fitting - unknown
    Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap’s four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result provides (...)
     
    Export citation  
     
    Bookmark   63 citations  
  23. The logic of proofs, semantically.Melvin Fitting - 2005 - Annals of Pure and Applied Logic 132 (1):1-25.
    A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   78 citations  
  24.  51
    Tableau methods of proof for modal logics.Melvin Fitting - 1972 - Notre Dame Journal of Formal Logic 13 (2):237-247.
  25.  72
    Notes on the mathematical aspects of Kripke’s theory of truth.Melvin Fitting - 1986 - Notre Dame Journal of Formal Logic 27 (1):75-88.
  26. Bilattices are nice things.Melvin Fitting - 2008 - In Thomas Bolander, Self-reference. Center for the Study of Language and Inf.
    One approach to the paradoxes of self-referential languages is to allow some sentences to lack a truth value (or to have more than one). Then assigning truth values where possible becomes a fixpoint construction and, following Kripke, this is usually carried out over a partially ordered family of three-valued truth-value assignments. Some years ago Matt Ginsberg introduced the notion of bilattice, with applications to artificial intelligence in mind. Bilattices generalize the structure Kripke used in a very natural way, while making (...)
     
    Export citation  
     
    Bookmark   36 citations  
  27.  6
    First‐Order Alethic Modal Logic.Melvin Fitting - 2002 - In Dale Jacquette, A Companion to Philosophical Logic. Malden, MA, USA: Wiley-Blackwell. pp. 410–421.
    This chapter contains sections titled: Introduction Intensions Models About Quantification Truth in Models Equality Rigidity De Re/De Dicto Partial Designation Designation and Existence Definite Descriptions What Next?
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Introduction.Melvin Fitting - 2017 - In Brian Rayman & Melvin Fitting, Raymond Smullyan on Self Reference. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  29. Modality and Databases.Melvin Fitting - unknown
    Two things are done in this paper. First, a modal logic in which one can quantify over both objects and concepts is presented; a semantics and a tableau system are given. It is a natural modal logic, extending standard versions, and capable of addressing several well-known philosophical difficulties successfully. Second, this modal logic is used to introduce a rather different way of looking at relational databases. The idea is to treat records as possible worlds, record entries as objects, and attributes (...)
     
    Export citation  
     
    Bookmark   1 citation  
  30. Modal Logics A Summary of the Well-Behaved.Melvin Fitting - unknown
    Modal logic is an enormous subject, and so any discussion of it must limit itself according to some set of principles. Modal logic is of interest to mathematicians, philosophers, linguists and computer scientists, for somewhat different reasons. Typically a philosopher may be interested in capturing some aspect of necessary truth, while a mathematician may be interested in characterizing a class of models having special structural features. For a computer scientist there is another criterion that is not as relevant for the (...)
     
    Export citation  
     
    Bookmark  
  31.  43
    Pseudo-Boolean valued prolog.Melvin Fitting - 1988 - Studia Logica 47 (2):85-91.
    A generalization of conventional Horn clause logic programming is proposed in which the space of truth values is a pseudo-Boolean or Heyting algebra, whose members may be thought of as evidences for propositions. A minimal model and an operational semantics is presented, and their equivalence is proved, thus generalizing the classic work of Van Emden and Kowalski.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  32. Tableaus and Dual Tableaus.Melvin Fitting - 2018 - In Michał Zawidzki & Joanna Golińska-Pilarek, Ewa Orłowska on Relational Methods in Logic and Computer Science. Cham, Switzerland: Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  33.  57
    Realizations and LP.Melvin Fitting - 2010 - Annals of Pure and Applied Logic 161 (3):368-387.
    LP can be seen as a logic of knowledge with justifications. See [S. Artemov, The logic of justification, The Review of Symbolic Logic 1 477–513] for a recent comprehensive survey of justification logics generally. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikka-style logic of knowledge S4, in which they are not explicitly present. Justifications, however, are far from unique. There are many ways of realizing each theorem of S4 in the logic LP. If (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  34.  31
    Strict/Tolerant Logics Built Using Generalized Weak Kleene Logics.Melvin Fitting - 2021 - Australasian Journal of Logic 18 (2).
    This paper continues my work of [9], which showed there was a broad family of many valued logics that have a strict/tolerant counterpart. Here we consider a generalization of weak Kleene three valued logic, instead of the strong version that was background for that earlier work. We explain the intuition behind that generalization, then determine a subclass of strict/tolerant structures in which a generalization of weak Kleene logic produces the same results that the strong Kleene generalization did. This paper provides (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  35.  63
    Bilattices and the theory of truth.Melvin Fitting - 1989 - Journal of Philosophical Logic 18 (3):225 - 256.
    While Kripke's original paper on the theory of truth used a three-valued logic, we believe a four-valued version is more natural. Its use allows for possible inconsistencies in information about the world, yet contains Kripke's development within it. Moreover, using a four-valued logic makes it possible to work with complete lattices rather than complete semi-lattices, and thus the mathematics is somewhat simplified. But more strikingly, the four-valued version has a wide, natural generalization to the family of interlaced bilattices. Thus, with (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   34 citations  
  36. Prefixed tableaus and nested sequents.Melvin Fitting - 2012 - Annals of Pure and Applied Logic 163 (3):291 - 313.
    Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  37.  42
    A tableau proof method admitting the empty domain.Melvin Fitting - 1971 - Notre Dame Journal of Formal Logic 12 (2):219-224.
  38.  61
    Paraconsistent Logic, Evidence, and Justification.Melvin Fitting - 2017 - Studia Logica 105 (6):1149-1166.
    In a forthcoming paper, Walter Carnielli and Abilio Rodrigues propose a Basic Logic of Evidence whose natural deduction rules are thought of as preserving evidence instead of truth. BLE turns out to be equivalent to Nelson’s paraconsistent logic N4, resulting from adding strong negation to Intuitionistic logic without Intuitionistic negation. The Carnielli/Rodrigues understanding of evidence is informal. Here we provide a formal alternative, using justification logic. First we introduce a modal logic, KX4, in which \ can be read as asserting (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   15 citations  
  39. First-order intensional logic.Melvin Fitting - 2004 - Annals of Pure and Applied Logic 127 (1-3):171-193.
    First - order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently, several semantics based on counterparts have been examined, in a development that goes back to David Lewis. There is yet another line of research, using intensional objects, that traces back to Richard Montague. I have been involved with this line of development for some time. In the present paper, I briefly sketch several (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   28 citations  
  40.  23
    Nested Sequents for Intuitionistic Logics.Melvin Fitting - 2014 - Notre Dame Journal of Formal Logic 55 (1):41-61.
  41.  69
    Intensional logic.Melvin Fitting - 2008 - Stanford Encyclopedia of Philosophy.
    There is an obvious difference between what a term designates and what it means. At least it is obvious that there is a difference. In some way, meaning determines designation, but is not synonymous with it. After all, “the morning star” and “the evening star” both designate the planet Venus, but don't have the same meaning. Intensional logic attempts to study both designation and meaning and investigate the relationships between them.
    Direct download  
     
    Export citation  
     
    Bookmark   19 citations  
  42. A quantified logic of evidence.Melvin Fitting - 2008 - Annals of Pure and Applied Logic 152 (1):67-83.
    A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  43. Tableaus for many-valued modal logic.Melvin Fitting - 1995 - Studia Logica 55 (1):63 - 87.
    We continue a series of papers on a family of many-valued modal logics, a family whose Kripke semantics involves many-valued accessibility relations. Earlier papers in the series presented a motivation in terms of a multiple-expert semantics. They also proved completeness of sequent calculus formulations for the logics, formulations using a cut rule in an essential way. In this paper a novel cut-free tableau formulation is presented, and its completeness is proved.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   16 citations  
  44.  73
    Term-modal logics.Melvin Fitting, Lars Thalmann & Andrei Voronkov - 2001 - Studia Logica 69 (1):133-169.
    Many powerful logics exist today for reasoning about multi-agent systems, but in most of these it is hard to reason about an infinite or indeterminate number of agents. Also the naming schemes used in the logics often lack expressiveness to name agents in an intuitive way.To obtain a more expressive language for multi-agent reasoning and a better naming scheme for agents, we introduce a family of logics called term-modal logics. A main feature of our logics is the use of modal (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   14 citations  
  45. Negation As Refutation.Melvin Fitting - unknown
    A refutation mechanism is introduced into logic programming, dual to the usual proof mechanism; then negation is treated via refutation. A four-valued logic is appropriate for the semantics: true, false, neither, both. Inconsistent programs are allowed, but inconsistencies remain localized. The four-valued logic is a well-known one, due to Belnap, and is the simplest example of Ginsberg’s bilattice notion. An efficient implementation based on semantic tableaux is sketched; it reduces to SLD resolution when negations are not involved. The resulting system (...)
     
    Export citation  
     
    Bookmark   9 citations  
  46. Modal logic should say more than it does.Melvin Fitting - unknown
    First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, as well as the well-known problems with equality, non-rigid designators, definite descriptions, and nondesignating terms. We show how all these problems disappear when modal language is made more expressive in a simple, natural way. We present a semantic tableaux system for the enhanced logic, and (very) briefly discuss implementation issues.
     
    Export citation  
     
    Bookmark   8 citations  
  47.  74
    Logics With Several Modal Operators.Melvin Fitting - 1969 - Theoria 35 (3):259-266.
  48.  57
    A Family of Strict/Tolerant Logics.Melvin Fitting - 2020 - Journal of Philosophical Logic 50 (2):363-394.
    Strict/tolerant logic, ST, evaluates the premises and the consequences of its consequence relation differently, with the premises held to stricter standards while consequences are treated more tolerantly. More specifically, ST is a three-valued logic with left sides of sequents understood as if in Kleene’s Strong Three Valued Logic, and right sides as if in Priest’s Logic of Paradox. Surprisingly, this hybrid validates the same sequents that classical logic does. A version of this result has been extended to meta, metameta, … (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  49. A logic of explicit knowledge.Melvin Fitting - unknown
    A well-known problem with Hintikka-style logics of knowledge is that of logical omniscience. One knows too much. This breaks down into two subproblems: one knows all tautologies, and one’s knowledge is closed under consequence. A way of addressing the second of these is to move from knowledge simpliciter, to knowledge for a reason. Then, as consequences become ‘further away’ from one’s basic knowledge, reasons for them become more complex, thus providing a kind of resource measurement. One kind of reason is (...)
     
    Export citation  
     
    Bookmark   8 citations  
  50.  52
    Computability theory, semantics, and logic programming.Melvin Fitting - 1987 - Oxford: Clarendon Press.
    This book describes computability theory and provides an extensive treatment of data structures and program correctness. It makes accessible some of the author's work on generalized recursion theory, particularly the material on the logic programming language PROLOG, which is currently of great interest. Fitting considers the relation of PROLOG logic programming to the LISP type of language.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 967