Log in

Relevant bibliographies by topics / Expressibility / Journal articles

To see the other types of publications on this topic, follow the link: Expressibility.

Journal articles on the topic 'Expressibility'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Expressibility.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

MANDELKERN, MATTHEW. "MODALITY AND EXPRESSIBILITY." Review of Symbolic Logic 12, no. 4 (January 4, 2019): 768–805. http://dx.doi.org/10.1017/s1755020318000394.

Full text

Abstract:

AbstractWhen embedding data are used to argue against semantic theory A and in favor of semantic theory B, it is important to ask whether A could make sense of those data. It is possible to ask that question on a case-by-case basis. But suppose we could show that A can make sense of all the embedding data which B can possibly make sense of. This would, on the one hand, undermine arguments in favor of B over A on the basis of embedding data. And, provided that the converse does not hold—that is, that A can make sense of strictly more embedding data than B can—it would also show that there is a precise sense in which B is more constrained than A, yielding a pro tanto simplicity-based consideration in favor of B. In this paper I develop tools which allow us to make comparisons of this kind, which I call comparisons of potential expressive power. I motivate the development of these tools by way of exploration of the recent debate about epistemic modals. Prominent theories which have been developed in response to embedding data turn out to be strictly less expressive than the standard relational theory, a fact which necessitates a reorientation in how to think about the choice between these theories.

APA, Harvard, Vancouver, ISO, and other styles

2

Nakaji, Kouhei, and Naoki Yamamoto. "Expressibility of the alternating layered ansatz for quantum computation." Quantum 5 (April 19, 2021): 434. http://dx.doi.org/10.22331/q-2021-04-19-434.

Full text

Abstract:

The hybrid quantum-classical algorithm is actively examined as a technique applicable even to intermediate-scale quantum computers. To execute this algorithm, the hardware efficient ansatz is often used, thanks to its implementability and expressibility; however, this ansatz has a critical issue in its trainability in the sense that it generically suffers from the so-called gradient vanishing problem. This issue can be resolved by limiting the circuit to the class of shallow alternating layered ansatz. However, even though the high trainability of this ansatz is proved, it is still unclear whether it has rich expressibility in state generation. In this paper, with a proper definition of the expressibility found in the literature, we show that the shallow alternating layered ansatz has almost the same level of expressibility as that of hardware efficient ansatz. Hence the expressibility and the trainability can coexist, giving a new designing method for quantum circuits in the intermediate-scale quantum computing era.

APA, Harvard, Vancouver, ISO, and other styles

3

Norn, Mogens. "Expressibility of Meibomian secretion." Acta Ophthalmologica 65, no. 2 (May 27, 2009): 137–42. http://dx.doi.org/10.1111/j.1755-3768.1987.tb06991.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Lee, Jinhee. "Dialetheism, Revenge and Expressibility." CHUL HAK SA SANG : Journal of Philosophical Ideas 77 (August 31, 2020): 75–104. http://dx.doi.org/10.15750/chss.77.202008.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Immerman, Neil. "Expressibility and Parallel Complexity." SIAM Journal on Computing 18, no. 3 (June 1989): 625–38. http://dx.doi.org/10.1137/0218043.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rusu, Andrei. "Infinitely Many Precomplete with Respect to Parametric Expressibility Classes of Formulas in a Provability Logic of Propositions." Analele Universitatii "Ovidius" Constanta - Seria Matematica 22, no. 1 (December 10, 2014): 247–55. http://dx.doi.org/10.2478/auom-2014-0020.

Full text

Abstract:

AbstractIn the present paper we consider a non-tabular extension L of the well-known propositional provability logic GL together with the notion of parametric expressibility of formulas in a logic proposed by A. V. Kuznetsov. We prove that there are infinitely many precomplete with respect to parametric expressibility classes of formulas in the above mentioned logic L.

APA, Harvard, Vancouver, ISO, and other styles

7

Andréka, Hajnal, Ivo Düntsch, and István Németi. "Expressibility of properties of relations." Journal of Symbolic Logic 60, no. 3 (September 1995): 970–91. http://dx.doi.org/10.2307/2275768.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hella, Lauri, and José M. Turull-Torres. "Expressibility of Higher Order Logics." Electronic Notes in Theoretical Computer Science 84 (September 2003): 129–40. http://dx.doi.org/10.1016/s1571-0661(04)80850-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Shapiro, Lionel. "Expressibility and the Liar's Revenge." Australasian Journal of Philosophy 89, no. 2 (June 2011): 297–314. http://dx.doi.org/10.1080/00048401003695156.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Bonner, Anthony J. "Hypothetical datalog: complexity and expressibility." Theoretical Computer Science 76, no. 1 (October 1990): 3–51. http://dx.doi.org/10.1016/0304-3975(90)90011-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Molzan, B. "Expressibility and Nonuniform Complexity Classes." SIAM Journal on Computing 19, no. 3 (June 1990): 411–23. http://dx.doi.org/10.1137/0219026.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Marcus, Leo, and Telis Menas. "Expressibility of output equals input." Acta Informatica 29, no. 6-7 (June 1992): 645–62. http://dx.doi.org/10.1007/bf01185565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Aceto, Luca, and Anna Ingolfsdottir. "On the expressibility of priority." Information Processing Letters 109, no. 1 (December 2008): 83–85. http://dx.doi.org/10.1016/j.ipl.2008.09.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Hella, Lauri, Leonid Libkin, and Juha Nurmonen. "Notions of locality and their logical characterizations over finite models." Journal of Symbolic Logic 64, no. 4 (December 1999): 1751–73. http://dx.doi.org/10.2307/2586810.

Full text

Abstract:

AbstractMany known tools for proving expressibility bounds for first-ordér logic are based on one of several locality properties. In this paper we characterize the relationship between those notions of locality. We note that Gaifman's locality theorem gives rise to two notions: one deals with sentences and one with open formulae. We prove that the former implies Hanf's notion of locality, which in turn implies Gaifman's locality for open formulae. Each of these implies the bounded degree property, which is one of the easiest tools for proving expressibility bounds. These results apply beyond the first-order case. We use them to derive expressibility bounds for first-order logic with unary quantifiers and counting. We also characterize the notions of locality on structures of small degree.

APA, Harvard, Vancouver, ISO, and other styles

15

Stewart, Iain A. "Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machine." Fundamenta Informaticae 18, no. 1 (January 1, 1993): 93–105. http://dx.doi.org/10.3233/fi-1993-18106.

Full text

Abstract:

This paper continues an investigation into the expressibility of the logic (±HP)*[FOS]. In particular, we show that the logic (±HP)*[FOS] has the same expressibility as its sub-logic (±HP)1[FOS] which is known to capture the complexity class LNP (this class being those sets of strings accepted by some logspace deterministic oracle Turing machine with an oracle in NP). We consequently show that a naturally defined hierarchy within PNP collapses.

APA, Harvard, Vancouver, ISO, and other styles

16

Bulatov, Andrei, Leslie Ann Goldberg, Mark Jerrum, David Richerby, and Stanislav Živný. "Functional clones and expressibility of partition functions." Theoretical Computer Science 687 (July 2017): 11–39. http://dx.doi.org/10.1016/j.tcs.2017.05.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

MAREK, VICTOR W., and JEFFREY B. REMMEL. "On the expressibility of stable logic programming." Theory and Practice of Logic Programming 3, no. 4+5 (July 2003): 551–67. http://dx.doi.org/10.1017/s1471068403001777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Stewart, Iain A. "Monotonicity and the Expressibility of NP Operators." Mathematical Logic Quarterly 40, no. 1 (1994): 132–40. http://dx.doi.org/10.1002/malq.19940400118.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Fu, Bin, and Qiongzhang Li. "The expressibility of first order dynamic logic." Journal of Computer Science and Technology 7, no. 3 (July 1992): 268–73. http://dx.doi.org/10.1007/bf02946577.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Rabinovich, Alexander. "Modularity and expressibility for nets of relations." Acta Informatica 35, no. 4 (April 1, 1998): 293–327. http://dx.doi.org/10.1007/s002360050122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Pereboom, Derk. "Mathematical expressibility, perceptual relativity, and secondary qualities." Studies in History and Philosophy of Science Part A 22, no. 1 (March 1991): 63–88. http://dx.doi.org/10.1016/0039-3681(91)90015-k.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hančl, Jaroslav, and Jan Šustek. "Sequences of cantor type and their expressibility." Mathematica Slovaca 67, no. 1 (February 1, 2017): 41–50. http://dx.doi.org/10.1515/ms-2016-0246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

VAN DER HOEK, W., and J. J. CH MEYER. "MAKING SOME ISSUES OF IMPLICIT KNOWLEDGE EXPLICIT." International Journal of Foundations of Computer Science 03, no. 02 (June 1992): 193–223. http://dx.doi.org/10.1142/s0129054192000139.

Full text

Abstract:

We discuss issues of expressibility and completeness of the logic of implicit knowledge (I) and “everybody’s knowledge” (E), as introduced in a system with a number m of epistemic agents by Halpern & Moses. The operator E is defined as a conjunction and corresponds semantically to the union of the m accessibility relations. Dually, the operator I is semantically associated with an intersection, but it is, surprisingly, not equivalent with a disjunction. From the view of Kripke structures there is a related asymmetry: although union can be modally defined, intersection cannot! We discuss consequences (in terms of (in)expressibility, correspondence and completeness) of this property for the epistemic logic under consideration and also present an extension of modal logic in which intersection is expressible.

APA, Harvard, Vancouver, ISO, and other styles

24

Bateman, John A. "Expressibility and the problem of efficient text planning." Machine Translation 11, no. 4 (1996): 243–49. http://dx.doi.org/10.1007/bf00387397.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hidders, Jan, Stefania Marrara, Jan Paredaens, and Roel Vercammen. "On the expressibility of functions in XQuery fragments." Information Systems 33, no. 4-5 (June 2008): 435–55. http://dx.doi.org/10.1016/j.is.2008.01.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Czerwiński, Wojciech, Sibylle Fröschle, and Sławomir Lasota. "Partially-commutative context-free processes: Expressibility and tractability." Information and Computation 209, no. 5 (May 2011): 782–98. http://dx.doi.org/10.1016/j.ic.2010.12.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Jensen, C. U. "Solvability by Real Radicals and Fermat Primes." Canadian Mathematical Bulletin 47, no. 2 (June 1, 2004): 229–36. http://dx.doi.org/10.4153/cmb-2004-022-9.

Full text

Abstract:

AbstractWe give a survey of old and new results concerning the expressibility of the real roots of a solvable polynomial over a real number field by real radicals. A characterization of Fermat primes is obtained in terms of solvability by real radicals for certain ploynomials.

APA, Harvard, Vancouver, ISO, and other styles

28

Chen, Chih-Chieh, Masaya Watabe, Kodai Shiba, Masaru Sogabe, Katsuyoshi Sakamoto, and Tomah Sogabe. "On the Expressibility and Overfitting of Quantum Circuit Learning." ACM Transactions on Quantum Computing 2, no. 2 (July 2021): 1–24. http://dx.doi.org/10.1145/3466797.

Full text

Abstract:

Applying quantum processors to model a high-dimensional function approximator is a typical method in quantum machine learning with potential advantage. It is conjectured that the unitarity of quantum circuits provides possible regularization to avoid overfitting. However, it is not clear how the regularization interplays with the expressibility under the limitation of current Noisy-Intermediate Scale Quantum devices. In this article, we perform simulations and theoretical analysis of the quantum circuit learning problem with hardware-efficient ansatz. Thorough numerical simulations show that the expressibility and generalization error scaling of the ansatz saturate when the circuit depth increases, implying the automatic regularization to avoid the overfitting issue in the quantum circuit learning scenario. This observation is supported by the theory on PAC learnability, which proves that VC dimension is upper bounded due to the locality and unitarity of the hardware-efficient ansatz. Our study provides supporting evidence for automatic regularization by unitarity to suppress overfitting and guidelines for possible performance improvement under hardware constraints.

APA, Harvard, Vancouver, ISO, and other styles

29

Maria Turull Torres, Jose. "On the expressibility and the computability of untyped queries." Annals of Pure and Applied Logic 108, no. 1-3 (March 2001): 345–71. http://dx.doi.org/10.1016/s0168-0072(00)00055-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Lu, Shourong, and Qichun Jin. "Expressibility Required to Design Embedded and Real-time Systems." Journal of Physics: Conference Series 1345 (November 2019): 022031. http://dx.doi.org/10.1088/1742-6596/1345/2/022031.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Karhumäki, Juhani, Filippo Mignosi, and Wojciech Plandowski. "The expressibility of languages and relations by word equations." Journal of the ACM 47, no. 3 (May 2000): 483–505. http://dx.doi.org/10.1145/337244.337255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

CELLINI, M., L. CELLINI, P. VERSURA, and EC CAMPOS. "Meibomian glands diagnostic expressibility: a new diagnostic medical device." Acta Ophthalmologica 88 (September 2010): 0. http://dx.doi.org/10.1111/j.1755-3768.2010.305.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Černá, Ivana, Mojmír Křetínsky, and Antonín Kučera. "Comparing expressibility of normed BPA and normed BPP processes." Acta Informatica 36, no. 3 (March 1, 1999): 233–56. http://dx.doi.org/10.1007/s002360050159.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Faĭziev, Valeriĭ A., and Prasanna K. Sahoo. "Pseudocharacters and the Problem of Expressibility for Some Groups." Journal of Algebra 250, no. 2 (April 2002): 603–37. http://dx.doi.org/10.1006/jabr.2001.9137.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Starostin, Mikhail V. "On some implicitly precomplete classes of monotone functions in Pk." Discrete Mathematics and Applications 30, no. 1 (February 25, 2020): 45–51. http://dx.doi.org/10.1515/dma-2020-0005.

Full text

Abstract:

AbstractThe paper is concerned with the completeness problem in implicit expressibility in a multi-valued logics Pk. For each k ≥ 2 and any nontrivial order relation on the set {0, 1, …, k − 1} we find two implicitly precomplete classes of functions which are monotone with respect to this order

APA, Harvard, Vancouver, ISO, and other styles

36

Song, Peng, Zhuo Sun, Shengwei Ren, Kaili Yang, Guohua Deng, Qingyan Zeng, and Yajie Sun. "Preoperative Management of MGD Alleviates the Aggravation of MGD and Dry Eye Induced by Cataract Surgery: A Prospective, Randomized Clinical Trial." BioMed Research International 2019 (April 11, 2019): 1–10. http://dx.doi.org/10.1155/2019/2737968.

Full text

Abstract:

Purpose. To investigate the effect of preoperative treatment and postoperative enhanced anti-inflammatory treatment on alleviating meibomian gland dysfunction (MGD) and dry eye induced by cataract surgery. Design. Prospective, randomized clinical trial. Methods. A total of 120 cataract patients with moderate obstructive-MGD were enrolled and randomized with 60:30:30 number of patients in cohorts I, II, and III, respectively: Cohort I: routine postoperative anti-inflammatory treatment; Cohort II: preoperative treatment (warming compress, lid hygiene, and anti-inflammatory treatment) and routine postoperative anti-inflammatory treatment; Cohort III: enhanced postoperative anti-inflammatory treatment. Main Outcomes Measures. All participants were examined preoperatively and postoperatively for ocular symptom score (OSS), noninvasive keratographic tear break-up time (NIKBUT), corneal fluorescein staining, Schirmer I test, lid margin, meibum quality and expressibility, and meibomian gland dropout. Results. Ocular surface disorders and MGD showed aggravated status at 1 month postoperatively in Cohort I and Cohort III, and the aggravated MGD resolved by 3 months postoperatively. At 1 month postoperatively, Cohort II and Cohort III presented high NIKBUT and low OSS, lid margin, and meibum quality and expressibility (Cohort II vs Cohort I: all P<0.001, respectively; Cohort III vs Cohort I: P=0.011, P=0.024, P=0.046, P=0.045, and P=0.012, respectively). Additionally, Cohort II had better outcomes of lid margin and meibum quality and expressibility than Cohort III at 1 month postoperatively (P=0.031, P=0.026, and P<0.001, respectively). At 3 months postoperatively, Cohort II presented a significantly higher NIKBUT than Cohort I and Cohort III (P<0.001 and P=0.001, respectively). Conclusion. Preoperative management of MGD is effective and optimal in alleviating obstructive-MGD and dry eye induced by cataract surgery.

APA, Harvard, Vancouver, ISO, and other styles

37

Faiziev, Valerii. "A problem of expressibility in some amalgamated products of groups." Journal of the Australian Mathematical Society 71, no. 1 (August 2001): 105–15. http://dx.doi.org/10.1017/s1446788700002743.

Full text

Abstract:

AbstractLet S be a subset of a group G such that S−1 = S. Denote by gr (S) the subgroup of G generated by S, and by ls(g) the length of an element g ∈ gr(S) relative to the set S. Suppose that V is a finite subset of a free group F of countable rank such that the verbal subgroup V (F) is a proper subgroup of F. For an arbitrary group G, denote by (G) the set of values in G of all the words from the set V. In the present paper, for amalgamated products G = A *HB such that A ≠ H and the number of double cosets of B by H is at least three, the infiniteness of the set {ls(g) | g ∈ gr(S)}, where S = (G) ∪ (G)−1, is estabilished.

APA, Harvard, Vancouver, ISO, and other styles

38

Belleri, Delia. "The Underdeterminacy of Sentences and the Expressibility of Our Thoughts." Dialectica 70, no. 1 (February 19, 2016): 29–48. http://dx.doi.org/10.1111/1746-8361.12126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

STEWART, IAIN A. "Comparing the Expressibility of Languages Formed Using NP-Complete Operators." Journal of Logic and Computation 1, no. 3 (1991): 305–30. http://dx.doi.org/10.1093/logcom/1.3.305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Meadows, Jillian F., Padmapriya Ramamoorthy, Jason J. Nichols, and Kelly K. Nichols. "Development of the 4–3–2–1 Meibum Expressibility Scale." Eye & Contact Lens: Science & Clinical Practice 38, no. 2 (March 2012): 86–92. http://dx.doi.org/10.1097/icl.0b013e318242b494.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Kanovich, Max. "Light linear logics with controlled weakening: Expressibility, confluent strong normalization." Annals of Pure and Applied Logic 163, no. 7 (July 2012): 854–74. http://dx.doi.org/10.1016/j.apal.2011.09.012.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Švejdar, V., and K. Bendová. "On inter-expressibility of logical connectives in Gödel fuzzy logic." Soft Computing 4, no. 2 (July 2000): 103–5. http://dx.doi.org/10.1007/s005000000036.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kyei, Samuel, Richard K. Dadzie Ephraim, Stephen Animful, Madison Adanusa, Stephen Karim Ali-Baya, Belinda Akorsah, Mabel Antwiwaa Sekyere, and Kofi Asiedu. "Impact of Serum Prolactin and Testosterone Levels on the Clinical Parameters of Dry Eye in Pregnant Women." Journal of Ophthalmology 2020 (August 30, 2020): 1–8. http://dx.doi.org/10.1155/2020/1491602.

Full text

Abstract:

Purpose. To explore the relationship between serum prolactin, testosterone level, and tear film parameters. The potential impact of these hormones on the health of the ocular surface in pregnant women was evaluated. Methods. This was a hospital-based cross-sectional study in which ocular symptoms (Ocular Surface Disease Index (OSDI)), tear function (fluorescein tear breakup time, Schirmer’s test 1), corneal and conjunctival staining, meibomian gland (MG) expressibility, and quality of secretion were measured. Lid margin findings including lid notching, thickness, and lid margin telangiectasia were also recorded. Venous blood was collected and the serum concentrations of prolactin and testosterone were determined using ELISA kits. Correlation and multiple linear regression analyses were used to examine predictors of dry eye symptoms and signs. Results. A total of 160 pregnant women participated in the study and their mean age was 30.1 ± 4.6 years (range 18–42 years). The correlation analysis indicated that testosterone concentration did not significantly correlate with any of the clinical parameters hence it was not included in the linear regression analysis. However, prolactin serum concentration correlated significantly with Schirmer’s test 1. Multiple linear regression was done to predict participants’ Schirmer’s test 1 score based upon their ocular surface staining score (oxford grading scale), meibomian gland expressibility, meibomian secretion quality, and serum concentration of prolactin. Only predictors that significantly correlated with Schirmer’s test 1 in the correlation analysis were included in the linear regression analysis. A significant regression equation was obtained (F (2, 157) = 5.119, p=0.007) with an R square of 0.05. Multiple linear regression analysis revealed that concentration of prolactin (ß coefficient = 0.032, p=0.044) and meibomian gland expressibility scores (ß coefficient = 2.14, p=0.016) were associated with Schirmer’s test 1 scores when adjusted for duration of pregnancy. Conclusion. The study showed that increased serum prolactin levels have a weak but positive impact on Schirmer’s test 1 scores whilst serum testosterone level has no association with the clinical parameters of dry eye in pregnant women.

APA, Harvard, Vancouver, ISO, and other styles

44

Hungar, Hardi. "EXPRESSIBILITY OF THE SEMANTICS OF SEQUENTIAL PROGRAMS IN FIRST-ORDER LOGIC." Fundamenta Informaticae 21, no. 4 (1994): 345–65. http://dx.doi.org/10.3233/fi-1994-2145.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Alexanderson, Simon, Carol O’sullivan, Michael Neff, and Jonas Beskow. "Mimebot—Investigating the Expressibility of Non-Verbal Communication Across Agent Embodiments." ACM Transactions on Applied Perception 14, no. 4 (September 18, 2017): 1–13. http://dx.doi.org/10.1145/3127590.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Formisano, Andrea, Eugenio G. Omodeo, and Alberto Policriti. "The axiom of elementary sets on the edge of Peircean expressibility." Journal of Symbolic Logic 70, no. 3 (September 2005): 953–68. http://dx.doi.org/10.2178/jsl/1122038922.

Full text

Abstract:

AbstractBeing able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables is crucially important for a satisfactory equational rendering of set theories along the lines proposed by Alfred Tarski and Steven Givant in their monograph of 1987.The main achievement of this paper is the proof that the ‘kernel’ set theory whose postulates are extensionality. (E), and single-element adjunction and removal. (W) and (L), cannot be axiomatized by means of three-variable sentences. This highlights a sharp edge to be crossed in order to attain an ‘algebraization’ of Set Theory. Indeed, one easily shows that the theory which results from the said kernel by addition of the null set axiom, (N), is in its entirety expressible in three variables.

APA, Harvard, Vancouver, ISO, and other styles

47

Dobrynina, I. V. "Solution of the problem of expressibility in amalgamated products of groups." Journal of Mathematical Sciences 166, no. 6 (April 23, 2010): 704–9. http://dx.doi.org/10.1007/s10958-010-9886-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Gate, James, and Iain A. Stewart. "The expressibility of fragments of Hybrid Graph Logic on finite digraphs." Journal of Applied Logic 11, no. 3 (September 2013): 272–88. http://dx.doi.org/10.1016/j.jal.2013.05.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Korb, Donald R., and Caroline A. Blackie. "Meibomian Gland Diagnostic Expressibility: Correlation With Dry Eye Symptoms and Gland Location." Cornea 27, no. 10 (December 2008): 1142–47. http://dx.doi.org/10.1097/ico.0b013e3181814cff.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Tarasov, V. V. "To the problem of expressibility in the algebra of partial Boolean functions." Problems of Information Transmission 41, no. 1 (January 2005): 59–64. http://dx.doi.org/10.1007/s11122-005-0010-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!